In order to solve the problem of many constraints and complex navigation environment in the path planning of unmanned surface vehicle(USV), an improved Sparrow search algorithm com-bining Cubic chaotic map and Gaussian random walk strategy was proposed to plan it. Firstly, in the population initialization stage, Cubic chaotic map was used to replace the random generation method of the traditional sparrow search algorithm to optimize the uneven initial distribution of the population and improve the global search ability of the population. Secondly, in the late it-eration of the algorithm, the standard deviation of fitness is introduced to determine whether the population is trapped in the local optimum. If true, the Gaussian random walk strategy is used to perturb the optimal individual and assist the algorithm to escape the local optimum. Thirdly, the chosen water environment is modeled, and the navigation information of the original inland electronic navigation chart(ENC) is preprocessed, gridized, and the obstacle swelling is processed. Finally, the path planning experiments of USV are carried out in inland ENC grid environment. The experimental results show that, compared with the traditional sparrow search algorithm, the average fitness value of the path planned by improved sparrow search algorithm is reduced by 14.8%, and the variance is reduced by 49.9%. The path planned by the algorithm is of good quality and high stability, and combined with ENC, it can provide a reliable path for USV.

：An effective technology for predicting the end-point phosphorous content of basic oxygen furnace (BOF) can provide theoretical instruction to improve the quality of steel via controlling the hardness and toughness. Given the slightly inadequate prediction accuracy in the existing prediction model, a novel hybrid method was suggested to more accurately predict the end-point phosphorus content by integrating an enhanced sparrow search algorithm (ESSA) and a multi-strategy with a deep extreme learning machine (DELM) as ESSA-DELM in this study. To begin with, the input weights and hidden biases of DELM were randomly selected, resulting in that DELM inevitably had a set of non-optimal or unnecessary weights and biases. Therefore, the ESSA was used to optimize the DELM in this work. For the ESSA, the Trigonometric substitution mechanism and Cauchy mutation were introduced to avoid trapping in local optima and improve the global exploration capacity in SSA. Finally, to evaluate the prediction efficiency of ESSSA-DELM, the proposed model was tested on process data of the converter from the Baogang steel plant. The efficacy of ESSA-DELM was more superior to that of other DELM-based hybrid prediction models and conventional models. The result demonstrated that the hit rate of end-point phosphorus content within ±0.003%, ±0.002%, and ±0.001% was 91.67%, 83.33%, and 63.55%, respectively. The proposed ESSA-DELM model could possess better prediction accuracy compared with other models, which could guide field operations.

A metering roundabout where traffic is controlled by traffic lights with phase times influenced by queue detector occupancy might be the solution to enhance performance when there are unbalanced traffic flows at roundabouts. There have, however, been minimal studies on how the distance of the queue detector from the stop line affects signal phase time durations and the queuing lengths. This research, therefore, seeks to develop a Cuckoo Search/Local search Algorithm using parameters such as arrival volumes, conflicting volumes, detector distance and phase time to investigate the relationship of signal setting, detector location and queuing formulations. Also, some additional statistical tests were performed for the fitness of the data. In order to conduct solid model validations, model output data was compared against the AIMSUN model. The results from the analyses demonstrated that the queue detector distance can affect phase time durations and vehicle queuing lengths on the controlling approach as well as queuing lengths on the metered approach. This study showed that, based on the study for the Old Belair Road roundabout in Adelaide, South Australia, the total queue length (controlling + metered) will be minimized when the detector is relocated at 209 meters from the roundabout stop line, giving longer phase green times and resulting in decreased intersection queuing lengths.

Preventive Maintenance (PM) is a periodic maintenance strategy, which has great results for devices in extending their life, increasing productivity, and most importantly, help avoid unexpected breakdowns and their costly consequence. A preventive maintenance scheduling (PMS) is determining the time for carrying out PM, and it represents a sensitive issue in terms of impact on production if the time for the PM process is not optimally distributed. In this study, hybrid heuristic methods were used to solve the PMS problem, as genetic algorithm and Tabu research were adopted. The optimal solution was reached in a short time compared to previous studies in which optimal methods were used, integer programming and nonlinear integer programming. Also, sensitivity analysis was applied to measure the robustness and strength of the method used, where an optimal solution was obtained for all experiments and in record time. This method can be used for power plants in privet or public sectors, to generate an optimal PMS, to save money, and to avoid water or electricity cuts.

Jellyfish search (JS) algorithm impersonates the foraging behavior of jellyfish in the ocean. It is a new developed meta-heuristic algorithm that solves complex and real world optimization problems. The global explore capability and robustness of JS are strong, but JS still has great development space in solving complex optimization problems with high dimensions and multiple local optima. Therefore, an enhanced jellyfish search (EJS) algorithm is developed in this study, and three improvements are made: (i) By adding sine and cosine learning factors, the jellyfish can learn from both random individual and best individual during Type B motion in swarm to enhance the optimization capability and convergence speed; (ii) Adding local escape operator can skip local optimal trap and boost the exploitation ability of JS; (iii) Opposition-based learning operator and quasi-opposition learning operator can increase and strengthen the population distribution more diversified, and better individuals are selected from present and new opposition-solution to participates in the next iteration, which can boost the solution’s quality, meanwhile convergence speed is fasted and its precision is increased. In addition, the performance contrast of the developed EJS and some previous outstanding and advanced methods are evaluated on CEC2017, CEC2019 test suite and six real engineering example of case. It is demonstrated that EJS algorithm escaped the trap of local optimum, enhanced the solution’s quality and the calculation speed. What’s more, the practical engineering applications of EJS algorithm also verify its superiority and effectiveness in solving both constrained and unconstrained optimization problems, and it stretched one’s mind for solving such optimization problems.

Feature selection is one of the main data preprocessing steps in machine learning. Its goal is to reduce the number of features by removing extra and noisy features. Feature selection methods must consider the accuracy of classification algorithms while performing feature reduction on a dataset. Meta-heuristic algorithms are the most successful and promising methods for solving this issue. The symbiotic organisms search algorithm is one of the successful meta-heuristic algorithms which is inspired by the interaction of organisms in the nature called Parasitism Commensalism Mutualism. In this paper, three engulfing binary methods based on the symbiotic organisms search algorithm are presented for solving the feature selection problem. In the first and second methods, several S-shaped and V-shaped transfer functions are used for binarizing the symbiotic organisms search algorithm, respectively. These methods are called BSOSS and BSOSV. In the third method, two new operators called BMP and BCP are presented for binarizing the symbiotic organisms search algorithm. This method is called EBSOS. The third approach presents an advanced binary version of the coexistence search algorithm with two new operators, BMP and BCP, to solve the feature selection problem, named EBSOS. The proposed methods are run on 18 standard UCI datasets and compared to base and important meta-heuristic algorithms. The test results show that the EBSOS method has the best performance among the three proposed approaches for binarization of the coexistence search algorithm. Finally, the proposed EBSOS approach was compared to other meta-heuristic methods including the genetic algorithm, binary bat algorithm, binary particle swarm algorithm, binary flower pollination algorithm, binary grey wolf algorithm, binary dragonfly algorithm, and binary chaotic crow search algorithm. The results of different experiments showed that the proposed EBSOS approach has better performance compared to other methods in terms of feature count and accuracy criteria. Furthermore, the proposed EBSOS approach was practically evaluated on spam email detection in particular. The results of this experiment also verified the performance of the proposed EBSOS approach. In addition, the proposed EBSOS approach is particularly combined with the classifiers including SVM, KNN, NB and MLP to evaluate this method performance in the detection of spam emails. The obtained results showed that the proposed EBSOS approach has significantly improved the accuracy and speed of all the classifiers in spam email detection.

The search algorithm based on symbiotic organisms’ interactions is a relatively recent bio-inspired algorithm of the swarm intelligence field for solving numerical optimization problems. It is meant to optimize applications based on the simulation of the symbiotic relationship among the distinct species in the ecosystem. The modified SOS algorithm is developed to solve independent task scheduling problems. This paper proposes a modified symbiotic organisms search based scheduling algorithm for efficient mapping of heterogeneous tasks to access cloud resources of different capacities. The significant contribution of this technique is the simplified representation of the algorithm's mutualism process, which uses equity as a measure of relationship characteristics or efficiency of species in the current ecosystem to move to the next generation. These relational characteristics are achieved by replacing the original mutual vector, which uses an arithmetic mean to measure the mutual characteristics with a geometric mean that enhances the survival advantage of two distinct species. The modified symbiotic organisms search algorithm (G_SOS) aimed to minimize the task execution time (Makespan), response, degree of imbalance and cost and improve the convergence speed for an optimal solution in an IaaS cloud. The performances of the proposed technique have been evaluated using a Cladism toolkit simulator, and the solutions are found to be better than the existing standard (SOS) technique and PSO.

The profile of secondary metabolites occurring in apple cuticular layer is not only characteristic for particular apple cultivar, but also dynamically reflects various external factors in growing environment. In this study, the possibility to authenticate apple samples based on analysis of their cuticular layer extracts was investigated. Ultra-high-performance liquid chromatography coupled to high resolution tandem mass spectrometry (UHPLC-HRMS/MS) was employed for obtaining metabolomic fingerprints. In total, 274 authentic apple samples, four cultivars harvested within the seasons 2020 to 2022 in the Czech Republic and Poland were analysed. The generated complex data processed by univariate and multivariate statistical methods enabled to build classification models for discrimination of apple cultivars as well as their geographical origin. The models showed very good performance in differentiation of Czech and Polish samples for three of four cultivars: ‘Gala’, ‘Golden Delicious’ and ‘Idared’, moreover, the validity of the models was verified over harvest seasons. The diagnostic markers, besides metabolites of triterpene biosynthetic pathway, mainly represented wax esters. ‘Jonagold’, which is known to be susceptible to mutations, was the only cultivar for which the unambiguous classification of geographical origin was not possible.

The minimum vertex cover (MVC) problem is a canonical NP-hard combinatorial optimization problem, aiming to find a smallest set of vertices such that every edge has at least one endpoint in the set, which has extensive applications in cyber security, scheduling, and monitoring link failures in wireless sensor networks (WSNs). Numerous local search algorithms have been proposed to obtain a “good” vertex cover. However, due to the NP-hard nature, it is challenging to efficiently solve the MVC problem, especially on large graphs. In this paper, we propose an efficient local search algorithm for MVC called TIVC, which is based on two main ideas: A 3-improvements (TI) framework with tiny perturbation, and an edge selection strategy. We conducted experiments on real-world large instances of a massive graph benchmark. Compared with two state-of-the-art MVC algorithms, TIVC shows superior performance in accuracy and possesses a remarkable ability to identify significantly smaller vertex covers on many graphs.

A number of challenging combinatorial optimization problems in logistics, transportations, aeronautics, and astronautics can be modeled as orienteering problems (OPs). To address the classic OP and its real-world variants, a parallel adaptive local-search algorithm based on competition and evolution (Palace) is proposed in this paper. In this algorithm, the parallelism runs proper local-search metaheuristics and operators to obtain the population per generation; then the competition grades those metaheuristics and operators to highlight the outperforming and eliminate the underperforming; also, the evolution explores large solution space and reproduces the best solutions for next generation. In this manner, the parallelism, competition, and evolution are organized in an easy-to-use algorithm and enable the expansibility, adaptivity, and exploration abilities, respectively. The Palace is examined on the classic and real-world Benchmarks about the OP, the time-dependent/independent OP with time windows, and the unmanned aerial vehicle and agile earth observation satellite planning. As a result, the Palace shows good performance in applicability and effectiveness in comparison with the state-of-the-art algorithms.

For the first time to optimize the creation of new neuroprotective agents based on bioflavonoids, we applied information technologies - docking analysis to calculate the binding of candidate molecules to the pharmacological target protein transthyretin, as well as the program of virtual screening of NO scavengers. As a result of this approach, the substance catechin was isolated from candidate molecules - quercetin, catechin, Epicatechin gallate, Epicatechin, Procyanidin B1, Procyanidin B2, Procyanidin B3, Catechin-3-gallate according to docking analysis. As a result of virtual screening, catechin was identified as a potential NO scavenger (55.15% prediction). The results of the prediction were confirmed by in vitro experiments. Course administration of catechin to animals with experimental multiple sclerosis (MS) against the background of methylprednisolone administration completely eliminated lethal cases, reduced the number of diseased animals by 20%, as well as prevented the development of severe neurological symptoms by 20% (compared to the methylprednisolone group) and by 60% compared to the control group. Course administration of catechin with methylprednisolone leads to decrease of neurodegradation markers in the cytosol of rats with EAE: NSE by 37%, and S-100 - by 54.8%. The combined administration of methylprednisolone significantly exceeds the combination of methylprednisolone with the reference drug mexidol by the degree of NSE reduction. The obtained results indicate a significant neuroprotective effect of ocular combinations of methylprednisolone and catechin. The above-mentioned confirms the correctness of bioflavonoid selection with the help of virtual screening program.

Quantum computing is tipped to lead the future of global technological progress. However, the obstacles related to quantum software development are an actual challenge to overcome. In this scenario, this work presents an implementation of the quantum search algorithm in Atos Quantum Assembly Language (AQASM) using the quantum software stack my Quantum Learning Machine (myQLM). We present the creation of a virtual quantum processor whose configurable architecture allows the analysis of induced quantum noise effects on the quantum algorithms. The codes are available throughout the manuscript so that readers can replicate them and apply the methods discussed in this article to solve their own quantum computing projects. The presented results are consistent with theoretical predictions and demonstrate that AQASM and myQLM are powerful tools for building, implementing, and simulating quantum hardware.

In data-scarce regions, prudent planning and precise decision-making for sustainable development especially in agriculture remains a challenging task due to the lack of correct information. Remotely sensed satellite images provide a powerful source for assessing land use land cover (LULC) classes and crop identification. Applying Remote Sensing (RS) in conjunction with the Geographical Information System (GIS) and modern tools/ algorithms of artificial intelligence (AI) and deep learning has been proven effective for strategic planning and integrated resources management. The (this)study was conducted in the canal command area of the Lower Chenab Canal system in Punjab, Pakistan. Crop features/ classes were assessed using the Normalized Difference Vegetation Index (NDVI) algorithm. The MODIS (Moderate Resolution Imaging Spectroradiometer) 250 m and Landsat 5 TM (thematic mapper) images were deployed for NDVI time-series analysis with unsupervised classification technique to get LULC classes that helped to discern cropping pattern, crop rotation, and the area of specific crops, which were then used as a key input for agricultural mechanization planning and resources management. The accuracy of the LULC map was 78%, assessed by the error matrix approach. Limitations of high-resolution RS data availability and the accuracy of the results are the concerns observed in this study that could be managed by the availability of good quality local sources and advanced techniques of processing, which will make it more useful and applicable for regional agriculture and environmental management.

As with many of the non-deterministic search algorithms, particularly those are analogous to complex biological systems, there are a number of inherent difficulties, and the Bees Algorithm (BA) is no exception. Basic versions and variations of the BA have their own drawbacks. Some of these drawbacks are a large number of parameters to be set, lack of methodology for parameter setting and computational complexity. This paper describes a Grouped version of the Bees Algorithm (GBA) addressing these issues. Unlike its conventional version, in this algorithm bees are grouped to search different sites with different neighbourhood sizes rather than just discovering two types of sites, namely elite and selected. Following a description of the GBA, the results gained for 12 benchmark functions are presented and compared with those of the basic BA, enhanced BA, standard BA and modified BA to demonstrate the efficacy of the proposed algorithm. Compared to the conventional implementations of the BA, the proposed version requires setting of fewer parameters, while producing the optimum solutions much faster.

Amidst increasing awareness of diet-health relationships, plant-derived bioactive peptides are recognized for their dual nutritional and health benefits. This study investigates bioactive peptides released after Alcalase hydrolysis of protein from chachafruto (Erythrina edulis), a nutrient-rich South American leguminous plant, focusing on their behavior during simulated gastrointestinal digestion. Evaluating their ability to scavenge radicals, mitigate oxidative stress, and influence immune response biomarkers, the study underscores the importance of understanding peptide interactions in digestion. Methods included previous enzymatic hydrolysis with Alcalase to obtain peptides, and results show significant radical scavenging and oxidative stress protection by chachafruto peptides. These findings highlight the potential of chachafruto bioactive peptides in functional foods and nutraceuticals, supporting human health through dietary interventions.

The optimization of guide vane closing schemes (OGVCS) of pumped storage hydro unit (PSHU) is the research field of cooperative control and optimal operation of pumped storage, wind power and solar power generation. This paper presents a OGVCS model of PSHU considering the rise rate of the unit rotational speed and the specific node pressure of each hydraulic unit, as well as various complicated hydraulic and mechanical constraints. OGVCS model is formulated as a multi-objective optimization problem to optimize conflictive objectives, i.e., unit rotational speed and water hammer pressure criteria. In order to realize the efficient solution of the OGVCS model, an enhanced multi-objective bacterial-foraging chemotaxis gravitational search algorithm (EMOBCGSA) is proposed to solve this problem, which adopts population reconstruction, adaptive selection chemotaxis operator of local searching strategy and Elite archive set to efficiently solve the multi-objective problem. Especially, novel constraints-handling strategy with eliminating and local search based on violation ranking is used to balance various hydraulic and mechanical constraints. Finally, simulation cases of complex extreme operating conditions (i.e., load rejection and pump outage) of ‘single tube-double units’ type PSHU system are conducted to verify the feasibility and effectiveness of the proposed EMOBCGSA in solving OGVCS problem. The simulation results indicate that the proposed EMOBCGSA can provide lower rise rate of the unit rotational speed and smaller water hammer pressure than other method established recently while considering various complex constraints in OGVCS problem.

Ecosystem surveillance monitoring is critical to managing natural resources and especially so under changing environments. Despite this importance, the design and implementation of monitoring programs across large temporal and spatial scales has been hampered by the lack of appropriately standardised methods and data streams. To address this gap, we outline a surveillance monitoring method based on permanent plots and voucher samples suited to rangeland environments around the world that is repeatable, cost-effective, appropriate for large-scale comparisons and adaptable to other global biomes. The method provides comprehensive data on vegetation composition and structure along with soil attributes relevant to plant growth, delivered as a combination of modules that can be targeted for different purposes or available resources. Plots are located in a stratified design across vegetation units, landforms and climates to enhance continental and global comparisons. Changes are investigated through revisits. Vegetation is measured to inform on composition, cover and structure. Samples of vegetation and soils are collected and tracked by barcode labels and stored long-term for subsequent analysis. Technology is used to enhance the accuracy of field methods, including differential GPS r plot locations, instrument based Leaf Area Index (LAI) measures, and three dimensional photo-panoramas for advanced analysis. A key feature of the method is the use of electronic field data collection to enhance data delivery into a publicly-accessible database.Our method is pragmatic, whilst still providing consistent data, information and samples on key vegetation and soil attributes. The method is operational and has been applied at more than 704 field locations across the Australian rangelands as part of the Ecosystem Surveillance program of the Terrestrial Ecosystem Research Network (TERN). The methodology enables continental analyses, and has been tested in communities broadly representative of rangelands globally, with components being applicable to other biomes. Here we also recommend the consultative process and guiding principles that drove the development of this method as an approach for development of the method into other biomes. The consistent, standardised and objective method enables continental, and potentially global analyses than were not previously possible with disparate programs and datasets.

The key links of face recognition are digital image preprocessing, facial feature extraction and pattern recognition, this article aimed at the current problem of slow speed and low recognition accuracy of face recognition , from the above three key links, on the basic of analyzing the therories of Fractional Differential Masks Operator (FDMO), Principal Component Analysis (PCA) and Support Vector Machine (SVM), design a kind of FDMO+PVA+SVM coupling algorithm that applies to face recognition to improve the speed and accuracy of it. To realize FDMO+PCA+SVM coupling algorithm, first, we should apply FDMO to face image processing binary marginalization, the purpose is getting face contour; Then, we apply PCA to get the feature of face image which is disposed by binary marainalization. At last, we can apply One-Against All of the SVM classifier and LibSVM software package to realize face recognition. Beside, the article with nine different coupling algorithm design four groups of experimental reaults on the ORL face database verified by comparative analysic FDMO+PCA+SVM coupling algorithm in the superiority of face recognition accuracy and speed.

Graph visualization has evolved significantly over time, offering various methods to effectively represent complex data structures. This study introduces a novel force-directed algorithm for 3D data visualization, specifically tailored for commonly used datasets in linked data visualization. Leveraging the power of graph theory and methods, the algorithm aims to address the challenge of creating visually appealing and easily interpretable visualizations, which often necessitate advanced user interaction. By utilizing 3D space and the Unity Engine, the research successfully visualizes data and develops interactive visualizations, overcoming limitations of basic force-directed implementations. The main contribution of presented research is in the force-directed algorithm with springs and controlled placement as a visualization technique that combines the use of springs and attractive forces to stabilize a graph in a 3D environment. The combination of these two techniques also helps prevent the formation of a single large cluster within the graph, enhancing the overall visualization quality.

In order to overcome the limitation of the traditional adaptive Unscented Kalman Filtering (UKF) algorithm in noise covariance estimation for statement and measurement, we propose a hybrid adaptive UKF algorithm based on combining Maximum a posteriori (MAP) criterion and Maximum likelihood (ML) criterion, in this paper. First, to prevent the actual noise covariance deviating from the true value which can lead to the state estimation error and arouse the filtering divergence, a real-time covariance matrices estimation algorithm based on hybrid MAP and ML is proposed for obtaining the statement and measurement noises covariance, respectively; and then, a balance equation the two kinds of covariance matrix is structured in this proposed to minimize the statement estimation error. Compared with the UFK based MAP and based ML, the proposed algorithm provides better convergence and stability.

With the increasing concern of environment, the energy-efficiency scheduling of manufacturing industry is becoming urgent and popular. In turning processes, both spindle speed and processing time can affect the final energy consumption and thus the spindle speed and scheduling scheme need to be optimized simultaneously. Since the turning workshop can be regarded as the flexible flow shop, this paper formulates a mixed integer linear programming model for energy-efficient scheduling of flexible flow shop. Accordingly, a new decoding method is developed by considering of the optimization of spindle speed and scheduling scheme simultaneously, and an estimation of distribution algorithm adopting the new decoding method is proposed to solve large-size problems. The parameters of this algorithm are determined by statistical technique with a simplified practical case. In order to validate the proposed method, a case from practical factories is studied, in which the makespan can be shortened by 25.22%, and the consumed energy can be saved by 5.48%. These results demonstrate the effectiveness of the proposed mathematical model and algorithm.

Earth observation satellites can capture images of specific areas in Earth's orbit based on user requirements. Despite the high demand for satellite imagery, satellites remain a scarce resource. When there are many observation tasks that are large and dense, they may interfere with each other due to satellite mobility. To address this issue, a multi-satellite scheduling algorithm based on a task merging mechanism has been proposed. This paper proposes a two-stage approach to the problem: task merging phase and merging task scheduling phase. The task merging phase introduces two methods based on Mean Shift and Complete Graph to generate the merging task set. In the merging task scheduling phase, a multi-satellite scheduling algorithm based on merging tasks is employed to solve the problem. Finally, certain measurement experiments suggest the effectiveness of the algorithm.

Lung cancer is the leading cause of cancer related mortality worldwide. In order to improve its overall survival, early diagnosis is required. Since current screening methods still face some pitfalls, such as high false positive rates for low-dose computed tomography, researchers are still looking for early biomarkers to complement existing screening techniques in order to provide a safe, faster and more accurate diagnosis. Biomarkers are biological molecules found in body fluids, such as plasma, that can be used to diagnose a condition or disease. Metabolomics has already shown to be a powerful tool in the search for cancer biomarkers since cancer cells are characterised by impaired metabolism, resulting in an adapted plasma metabolite profile. The metabolite profile can be determined using nuclear magnetic resonance, or NMR. Although metabolomics and NMR metabolite profiling of blood plasma are still under investigation, there is already evidence for its potential for early-stage lung cancer diagnosis, therapy response, and follow-up monitoring. This review highlights some key breakthroughs in this research field, where the most significant biomarkers will be discussed in relation with their metabolic pathways and in light of the altered cancer metabolism.

In wireless sensor networks (WSNs), each sensor node can estimate the global parameter from the local data in distributed manner. This paper proposed a robust diffusion estimation algorithm based on minimum error entropy criterion with self-adjusting step-size, which are referred to as diffusion MEE-SAS (DMEE-SAS) algorithm. The DMEE-SAS algorithm has fast speed of convergence and is robust against non-Gaussian noise in the measurements. The detailed performance analysis of the DMEE-SAS algorithm is performed. By combining the DMEE-SAS with diffusion minimum error entropy (DMEE) algorithms, an Improving DMEE-SAS algorithm is proposed, in non-stationary environment where tracking is very important. The Improving DMEE-SAS algorithm can avoid insensitivity of the DMEE-SAS algorithm due to the small effective step-size near the optimal estimator, and obtain a fast convergence speed. Numerical simulations are given to verify the effectiveness and advantages of these proposed algorithms.

Since December 2019, the COVID-19 virus has rapidly spread worldwide, prompting the World Health Organization (WHO) to declare it a pandemic and advocate for the widespread use of face masks to mitigate transmission. In this review, we delve into the potential impact of prolonged face mask use on temporomandibular joint (TMJ) health, an area that has garnered limited attention amidst COVID-19 research. Research has revealed that improper mask fit, and constant readjustment can lead to TMJ abnormalities. Similarly, there is a demonstrated correlation between continuous mask usage and increased incidence of headaches, temporomandibular pain, and diminished quality of life. Many studies have highlighted discomfort in the preauricular area, headaches, TMJ noises, headache, jaw pain, and muscle fatigue, as well as dermatological disorders that have been attributed to prolonged mask wear and its impact on TMJ. Our study catalyzes future research endeavors, urging a deeper exploration of the implications of long-term mask wear, not only in the context of the COVID-19 pandemic but also among occupational groups regularly exposed to extended mask use. By unraveling the complexities of TMJ health in the face of evolving preventive measures, we aim to enhance our understanding and safeguard the well-being of mask-wearers worldwide.

Mobile inspections conducted by intelligent tunnel robots are instrumental in broadening the inspection reach, economizing on inspection expenditures, and augmenting the operational efficiency of inspections. Despite differences from fixed surveillance, mobile-captured traffic videos have complex backgrounds and device conditions that interfere with accurate traffic event identification, warranting more research. This paper proposes an improved algorithm based on YOLOv9 and DeepSORT for intelligent event detection in edge computing mobile device using the intelligent tunnel robot. The enhancements comprise the integration of the Temporal Shift Module to boost temporal feature recognition and the establishment of logical rules for identifying diverse traffic incidents in mobile video imagery. Experimental results show that our fused algorithm achieves a 93.25% accuracy rate, an inprovement of 1.75% over the baseline. The algorithm is also applicable to inspection vehicles, drones, and autonomous vehicles, effectively enhancing the detection of traffic events and improving traffic safety.

The combination of encryption and digital watermarking technologies is a trend to achieve full lifecycle data protection. Recently, reversible data hiding in encrypted domain (RDHED) has greatly aroused the interests of many scholars. But the fixed order of first encryption and then watermarking makes this kind of algorithms unsuitable to many applications. Commutative encryption and watermarking (CEW) technology realizes the flexible combination of encryption and watermarking, and suits more applications. However, most existing CEW schemes for vector maps are not reversible and unsuitable to high precision maps. To solve this problem, here we propose a commutative encryption and reversible watermarking (CERW) algorithm for vector maps based on virtual coordinates which are uniformly distributed on the number axis. The CERW algorithm consists of virtual interval step based encryption scheme and coordinate difference based reversible watermarking scheme. In the encryption scheme, the map coordinates are moved randomly by multiples of virtual interval step defined as distance between two adjacent virtual coordinates. In the reversible watermarking scheme, difference expansion (DE) technique is used to embed the watermark bit into the coordinate difference computed based on the relative position of a map coordinate in a virtual interval. Since the relative position of a map coordinate in a virtual interval keeps unchanged during the coordinate scrambling encryption process, the watermarking operation and the encryption operation don’t interfere with each other and the commutativity between encryption and watermarking achieves. Results show that: proposed method has high security, high capacity and good invisibility. In addition, the algorithm is not only applicable to polyline and polygon vector data, but also can be applied to sparsely distributed point data which the traditional DE watermarking algorithm often fails to watermark.

YOLOv8, as an efficient object detection method, can swiftly and precisely identify objects within images. However, traditional algorithms encounter difficulties when detecting small targets in remote sensing images, such as missing information, background noise, and interactions among multiple objects in complex scenes, which may affect performance. To tackle these challenges, we propose an enhanced algorithm optimized for detecting small objects in remote sensing images, named HP-YOLOv8. Firstly, we design the C2f-D-Mixer (C2f-DM) module as a replacement for the original C2f module. This module integrates both local and global information, significantly improving the ability to detect features of small objects. Secondly, we introduce a feature fusion technique based on attention mechanisms, named Bi-Level Routing Attention in Gated Feature Pyramid Network (BGFPN). This technique utilizes an efficient feature aggregation network and reparameterization technology to optimize information interaction between different scale feature maps, and through the Bi-level Routing Attention (BRA) mechanism, it effectively captures critical feature information of small target objects. Finally, we propose the Smooth Mean Perpendicular Distance Intersection over Union (SMPDIoU) loss function. The method comprehensively considers the shape and size of detection boxes, enhances the model's focus on the attributes of detection boxes and provides a more accurate bounding box regression loss calculation method. To demonstrate our approach's efficacy, we conduct comprehensive experiments across the RSOD, NWPU VHR-10, and VisDrone2019 datasets. The experimental results show that the HP-YOLOv8 achieves 95.11%, 93.05%, and 53.49% in the [email protected] metric, and 72.03%, 65.37%, and 38.91% in the more stringent [email protected]:0.95 metric, respectively.

This paper proposes a new approach for multi-focus images fusion based on Region Mosaicing on Contrast Pyramids (REMCP). A density-based region growing method is developed to construct a focused region mask for multi-focus images. The segmented focused region mask is decomposed into a mask pyramid, which is then used for supervised region mosaicking on a contrast pyramid. In this way, the focus measurement and the continuity of focused regions are incorporated and the pixel level pyramid fusion is improved at the region level. Objective and subjective experiments show that the proposed REMCP is more robust to noise than compared algorithms and can fully preserves the focus information of the multi-focus images meanwhile reducing distortions of the fused images.

Within environmental perception, automatic navigation and object detection, computer vision is a crucial and demanding field with many applications in modern industries, such as multi-target long-term visual tracking in automated production, defect detection, and driverless robotic vehicles with sensing ability. The performance of computer vision has greatly improved recently thanks to developments in deep learning algorithms and hardware computing capabilities, which has spawned the creation of a large number of related applications. This paper presents the results of a detailed review of over 50 papers published over the course of two decades (1999–2024), with a primary focus on the technical advancement of computer vision. To elucidate the foundational principles, an examination of typical visual algorithms based on traditional correlation filtering was initially conducted. Subsequently, a comprehensive overview of the most recent advancements in deep learning-based computer vision techniques was compiled. Furthermore, a comparative analysis between conventional and novel algorithms was undertaken to discuss the future trends and directions of computer vision. Lastly, the feasibility of employing visual SLAM (Simultaneous Localization and Mapping) algorithms in the context of autonomous vehicles with sensing capability was explored. Furthermore, we explored a thorough and efficient architecture for utilizing these techniques in autonomous robotic vehicles into unmanned green and low-carbon smart factories, underlining novel advances as well as potential prospects for future research.

Pavement crack detection is one of the key links in highway pavement maintenance management. In the current road crack detection, the network model easily ignores the shallow geometric features of cracks and cannot extract the key feature information of cracks. Aiming at the above problems, an EC-YOLOX network model is proposed. The CFPN is constructed to cross-fuse different scale features to solve the feature scale invariance. In the strengthen feature extraction layer, ECANet is fused to enhance the ability to pay attention to key information. The WEIoU loss function is proposed, which assigns different penalty terms to the target box in the vertical and horizontal directions. In terms of data, geometric distortion constraint correction is performed on the single-point perspective pavement image. The experimental data show that the accuracy of EC-YOLOX on the self-built data set reaches 76.34% [email protected], which is 4.45% higher than that of YOLOX. The loss curve of EC-YOLOX is smoother than that of YOLOX, and the minimum training loss value is 2.136, which is 0.648 lower than the minimum loss value 2.784 of YOLOX. Many experiments have verified the effectiveness of EC-YOLOX in improving the detection effect in pavement crack detection.

In this paper, we first discuss the research status and application progress of the finite element method and the smoothed particle method. By analyzing the advantages of the smoothed particle method and the finite element method, a new coupling algorithm, namely FEM-SPH algorithm, is proposed. By the method of comparison, it shows that finite element method and SPH method in the simulation of large deformation problems each have advantages and disadvantages, the finite element method smoothed particle coupling algorithm is effective to achieve the performance of high computational efficiency and can naturally simulate large deformation problems across. In the process of calculation, the large deformation unit can be freely into an algorithm to facilitate the calculation accuracy and efficiency of three methods of numerical simulation. Through the study found, FEM-SPH algorithm not only overcome the defect of smooth particle tensile instability, but also overcomes the problem of low efficiency of finite element computation. To further test the FEM-SPH algorithm has advantages in the practical engineering, we have carried out the actual test to the example of the super high speed collision, concluded that, since the target of most of the computational domain is always finite element, smoothed particle focused only in contact with the projectile and target of local area, particle number is not much, the whole calculation process just ten minutes, computational efficiency has been greatly improved, at the same time in the simulation of large deformation, the advantage is very obvious .This provides a criterion for the actual project, depending on the specific material deformation mode and choose a more appropriate conversion algorithm.

As the fast growth of information technology (IT), the safety of image transmission and the storing of images are increasingly concerned. Traditional image encryption algorithms have certain limitations in transmission and security, so there is an urgent need for a secure and reliable image encryption algorithm. A universal compression sensing (CS) image encryption (IE) algorithm based on DNA-triploid mutation (DTM) is presented in this paper. Firstly, by using CS algorithm an image is compressed while obtaining a range of chaotic sequences by iteration of chaotic map. Then DNA sequences are generated by encoding the image, and based on the DTM, new mutant DNA sequences are generated according to specific rules. Next, the chaotic sequences are operated at the DNA level to do confusion and diffusion operations on the image to ensure the security of the data. At last, DNA decoding is carried out to obtain the compressed-encrypted image. Both simulation experiments and performance tests fully show that a high level of security and reliability of the proposed algorithm in protecting image privacy is achieved.

In recent years, the AHRS has become an important research area. In order to improve the orientation measurement accuracy of AHRS, this paper first expounds the algorithm principle of the AHRS. Then, aiming at the problem of poor stability of the traditional gradient descent method under high dynamics or large magnetic field interference, a gain-scheduled anti-interference AHRS orientation algorithm is designed. By using the switching architecture designed with this algorithm for gain scheduling, it can ensure stable performance while being subjected to apparent acceleration and ferromagnetic interference. Finally, experimental verification is conducted, and the experimental results show that: in the presence of interference, the roll angle error is 0.0350°, the pitch angle error is 0.0277°, and the yaw angle error is 0.9611°, thereby verifying the strong anti-interference performance of the gain-scheduled AHRS orientation algorithm proposed in this paper.

The paper presents an error model of a measurement chain containing link performing discrete wavelet transform algorithm which is most often the last stage of measurement signal processing. The goal is to determine the uncertainty budget of the input quantities of the wavelet transform algorithm. The error model takes into account parts of analog, analog-to-digital and digital processing, describing the properties of subsequent fragments of the chain using their transmittance and processing functions. The proposed model enables the description of both deterministic and non-deterministic properties of signal errors. The proposed model was validated using an example measurement chain created for this purpose.

Depth-sensing technology has led to broad applications of inexpensive depth cameras that can capture human motion and scenes in 3D space. Background subtraction algorithms can be improved by fusing color and depth cues, thereby allowing many issues encountered in classical color segmentation to be solved. In this paper, we propose a new fusion method that combines depth and color information for foreground segmentation based on an advanced color-based algorithm. First, a background model and a depth model are developed. Then, based on these models, we propose a new updating strategy that can eliminate ghosting and black shadows almost completely. Extensive experiments have been performed to compare the proposed algorithm with other, conventional RGB-D algorithms. The experimental results suggest that our method extracts foregrounds with higher effectiveness and efficiency.

The conventional well placement was done manually by using a numerical reservoir simulator, and it required a lengthy trial-and-error process. It required great experience and expertise to manipulate the variables and uncertainties that lie on the reservoir to determine the best placement of the well. In addition, the traditional gradient-based methods such as Line-search and Trust-region were not viable in terms of maximum results obtained. Gradient-based methods were too dependent on the surface gradient of the solution and may only converge to local optima instead of global optima. Complex reservoirs have rough surfaces with high uncertainties, which hinders the traditional gradient-based method from converging to global optima. Thus, genetic algorithms were utilized to automate the manual trial-and-error process and to overcome the limitations of the traditional gradient-based method. The objectives of this study were to analyse the effect of different initial well placement distributions, the number of random solution sizes, and the crossover rate on cumulative oil production. A synthetic reservoir model built using CMG Builder was used as the testing platform for the optimization problems. Well-placement parameterization and optimization set-up were carried out using the CMG CMOST optimization tool. The integration of CMG IMEX and CMOST optimized cumulative oil production based on the objectives of the study. The results obtained showed that the higher number of random solutions used resulted in higher cumulative oil production, with more generations needed to reach the optimum solution. It can be concluded that the larger number of random solutions used increased the probability of reaching the optimum solution, but will take more generations.

Classifying network flow subsequences in an Industrial IoT gateway is an effective method for identifying Industrial IoT faults. This paper proposes a subsequence classification algorithm SSGBUL-IKNN based on unsupervised learning encoding to address the problem of low classification accuracy. Firstly, we built a network module based on unsupervised learning to encode the flow sequence of the Industrial IoT gateway. In the encoding module, a subsequence calibration algorithm controls the increasing error during the coding process. Then, the specific fault type is obtained through an improved KNN classification algorithm based on the indication distance source from the integrated coding sequences converted by multi-dimensional network flow sequences. The test result on three Industrial IoT datasets of a sewage treatment plant shows that the accuracy of SSGBUL-IKNN in this paper exceeds 92%, significantly higher than the algorithm DTW and TSF. It reaches the classification requirements of Industrial IoT fault diagnosis.

This study introduces an advanced dual-mode composite attitude control framework for reusable launch vehicles (RLVs), underpinned by an enhanced particle swarm optimization (PSO) algorithm. This innovative strategy is tailored to meet the stringent demands for precision and robust anti-interference capabilities across the entire flight envelope of RLVs. The research commences with the formulation of a comprehensive attitude dynamics model and diverse heterogeneous actuator representations, meticulously crafted to reflect the distinct phases of RLV flight. Building upon this foundation, a synergistic control paradigm is engineered, integrating PID and fuzzy PID controllers, complemented by a refined fitness evaluation function. The crux of the study is the application of an upgraded PSO algorithm to fine-tune the controllers' weighting coefficients, culminating in an optimized dual-mode composite attitude control system. A series of comparative simulation analyses are meticulously executed to appraise the system's responsiveness, stability, precision, and resilience to interference. The findings unequivocally substantiate the superior performance of the proposed control system, affirming its substantial contribution to the advancement of RLV attitude control.

Underwater Sensor Networks (UWSNs) can enable a broad range of applications such as resource monitoring, disaster prevention, and navigation-assisted. It is especially relevant for sensor nodes location in UWSNs. Global Positioning System (GPS) is not suitable for using in UWSNs because of the underwater propagation problems. Hence some localization algorithms based on the precise time synchronization between sensor nodes have been proposed which are not feasible for UWSNs. In this paper, we propose a localization algorithm called Two-Phase Time Synchronization-Free Localization Algorithm (TP-TSFLA). TP-TSFLA contains two phases, namely, range-based estimation phase and range-free evaluation phase. In the first phase, we address a time synchronization-free localization scheme base on the Particle Swarm Optimization (PSO) algorithm to decrease the localization error. In the second phase, we propose a Circle-based Range-Free Localization Algorithm (CRFLA) to locate the unlocalized sensor nodes which cannot obtain the location information through the first phase. In the second phase, sensor nodes which are localized in the first phase act as the new anchor nodes to help realize localization. Hence in this algorithm, we use a small number of mobile beacons to help achieve location without any other anchor nodes. Besides, to improve the precision of the range-free method, an extension of CRFLA by designing a coordinate adjustment scheme is updated. The simulation results show that TP-TSFLA can achieve a relative high localization ratio without time synchronization.

Feature selection is predominantly used in machine learning tasks, such as classification and regression. It selects a subset of features (relevant attributes of data points) from a larger set that contributes as optimally as possible to the informativeness of the model. There are exponentially many subsets of a given set, and thus, the exhaustive search is only practical for problems with at most a few dozen features. In the past, there have been attempts to reduce the search space using dynamic programming. However, models that consider similarity in pairs of features besides the quality of individual features do not provide the required optimal substructure. As a result, algorithms, which we will call suboptimal dynamic programming algorithms, find a solution that may deviate significantly from the optimal one. In this paper, we propose a dynamic programming algorithm with an iterative upgrade where the order of feature processing is inverted in each iteration. Such an alternating approach allows for improving the optimization function by using the score from the previous iteration to estimate the contribution of unprocessed features. The iterative process is proven to converge and terminate when the solution does not change in three successive iterations or when the number of iterations reaches the threshold. Results in more than 90 % of tests align with those of the exhaustive search, being competitive and often superior to the reference greedy approach. The validation was done by comparing the scores of output feature subsets and examining the accuracy of different classifiers learned on these features. In the context of feature selection, the proposed algorithm can be characterized as a filter method. However, we expect that the idea of alternating suboptimal optimization will soon be generalized to tasks beyond feature selection.

High dimensional datasets are highly likely to have redundant, irrelevant, and noisy features that negatively affect the performance of the classification algorithms. Selecting the most relevant features and reducing the dimensions of datasets by removing the undesired features is a dimensional reduction technique called Feature Selection (FS). In this paper, we propose an FS approach based on the Black Hole Algorithms (BHO) with a mutation technique called MBHO. Generally, BHO contains two major phases. At the exploitation phase, a set of stars are modified based on some rule and according to some objective function, the best star is selected as the black hole which attracts other stars. Furthermore, when a star gets closer to the event horizon, it will be swallowed and a new one will be randomly generated in the search space which thus is the exploration phase. However, randomness may cause the algorithm to fall into the trap of local optima, and to overcome such complications, inversion mutation is used. Furthermore, we modify a widely utilized objective function in most of the proposed works for wrapper feature selection by combining two new terms that are based on the correlation among the selected subset of features and the features and the classification label. We also utilize a transfer function, known as the V2 transfer function, to convert continuous values into discrete ones to enhance search. We assess our approach via extensive evaluation experiments using fourteen benchmark datasets. We benchmark the performance of a wrapper FS approach called Binary Cuckoo Search (BCS), and three filter-based FS approaches (namely Mutual Information Maximisation (MIM), Joint Mutual Information (JMI), and minimum Redundancy Maximum Relevance (mRMR)). Our evaluation has shown that the proposed model is an effective approach for FS, in selecting better features that enhance the performance metrics on the classifiers. Thus, MBHO can be utilized as one alternative to the existing state-of-art-approaches. We release the source codes of our implementation for the community to build on with new methods and datasets.

Recent advances in quantum computing systems attract tremendous attention. Commercial companies, such as IBM, Amazon, and IonQ, have started to provide access to noisy intermediate-scale quantum computers. Researchers and entrepreneurs attempt to deploy their applications that aim to achieve a quantum speedup. Grover’s algorithm and quantum phase estimation are the foundations of many applications with the potential for such a speedup. While these algorithms, in theory, obtain marvelous performance, deploying them on existing quantum devices is a challenging task. For example, quantum phase estimation requires extra qubits and a large number of controlled operations, which are impractical due to low-qubit and noisy hardware. To fully utilize the limited onboard qubits, we develop a distributed application with a key-value data structure based on Grover’s algorithm called IQuCS . Consider a database with duplicates. By encoding each element to a binary type with a unique key and forming a key-value pair, we can count the number of occurrences of each element in the database based on quantum computing. We have optimized the operation process by filtering data points to make it more efficient. To determine the effect of this optimization, we evaluate it with datasets of different sizes and with different numbers of duplicates. With the assistance of classical computers, IQuCS can reduce the problem set for each query. Due to this reduction, IQuCS requires fewer qubits. Through the iterative management, IQuCS achieves a reduction of qubit virtualized consumption, up to 66.2%, with reasonable accuracy.

With the integrated development of the Internet, wireless sensor technology, cloud computing, and mobile Internet, there has been a lot of attention given to research about and applications of the Internet of Things. A Wireless Sensor Network (WSN) is one of the important information technologies in the Internet of Things; it integrates multi-technology to detect and gather information in a network environment by mutual cooperation, using a variety of methods to process and analyze data, implement awareness, and perform tests. This paper mainly researches the localization algorithm of sensor nodes in a wireless sensor network. Firstly, a multi-granularity region partition is proposed to divide the location region. In the range-based method, the RSSI (Received Signal Strength indicator, RSSI) is used to estimate distance. The optimal RSSI value is computed by the Gaussian fitting method. Furthermore, a Voronoi diagram is characterized by the use of dividing region. Rach anchor node is regarded as the center of each region; the whole position region is divided into several regions and the sub-region of neighboring nodes is combined into triangles while the unknown node is locked in the ultimate area. Secondly, the multi-granularity regional division and Lagrange multiplier method are used to calculate the final coordinates. Because nodes are influenced by many factors in the practical application, two kinds of positioning methods are designed: the unknown node is in the positioning unit or not. When the unknown node is on the side of the positioning unit, we use the method of vector similarity. Moreover, we use the centroid algorithm to calculate the ultimate coordinates of unknown node. When the unknown node is not on the side of the positioning unit, we establish a Lagrange equation containing the constraint condition to calculate the first coordinates. Furthermore, we use the Taylor expansion formula to correct the coordinates of the unknown node. In addition, this localization method has been validated by establishing the real environment.

The objective of this study was to investigate the impact of athletes' respiratory muscle strength, as assessed through maximal inspiratory (MIP) and expiratory pressure (MEP), on aerobic endurance, as indicated by maximal oxygen consump-tion (Max VO2) kinetics. Respiratory muscle strength was assessed using a digital spirometer (Pony FX Cosmed, Italy), while maximal oxygen utilization capacity was measured using a breath-by-breath automatic portable gas analysis system (Cosmed K5, Italy). Statistical analysis was conducted utilizing SPSS 22.0. Based on the standardized regression coefficients (β), it was found that MEP (mean ± SD: 130.95 ± 42.82) and inspiratory diaphragmatic circumference values significantly influenced ventilatory equivalent (VE), oxygen consumption (VO2), and carbon dioxide pro-duction (VCO2). Conversely, the remaining predictor variables did not exhibit a sig-nificant effect on VE (mean ± SD: 134.80 ± 36.69), VO2 (mean ± SD: 3877.52 ± 868.47 ml), and VCO2 (mean ± SD: 4301.27 ± 1001.07 ml). In contrast, measurements of chest circumference (mean ± SD: 91.40 ± 10.72 cm), MEP, and diaphragmatic cir-cumference during inspiration (mean ± SD: 95.20 ± 10.21 cm) were found to signifi-cantly impact Max VO2 (mean ± SD: 58.52 ± 10.74 ml/kg/min), while the other pre-dictor variables did not demonstrate a significant effect on Max VO2. Conclusively, the study revealed that measured values of diaphragmatic circumference during inspiration and MEP exerted a notable influence on Max VO2, VE, VO2, and VCO2. Our findings underscore the importance of considering respiratory muscle strength in assessing and enhancing athletes' aerobic performance. These insights contribute to a deeper understanding of the interplay between respiratory function and exercise capacity, offering potential avenues for optimizing training regimens and perfor-mance outcomes in athletic contexts.

This article investigates the effectiveness of feature extraction and selection techniques for enhancing the performance of classifiers accuracy in Type II Diabetes Mellitus (DM) detection using microarray gene data. To address the inherent high dimensionality of the data by employing three Feature Extraction (FE) methods are used namely, Short-Time Fourier Transform (STFT), Ridge Regression (RR), and Pearson Correlation Coefficient (PCC). To further refine the data, meta-heuristic algorithms like Bald Eagle Search Optimization (BESO) and Red Deer Optimization (RDO) are utilized for feature selection. The performance of seven classification techniques such as Non-Linear Regression - NLR, Linear Regression - LR, Gaussian Mixture Model - GMM, Expectation Maximization - EM, Logistic Regression - LoR, Softmax Discriminant Classifier - SDC, and Support Vector Machine with Radial Basis Function kernel - SVM-RBF are evaluated with and without feature selection. The analysis reveals that the combination of PCC with SVM-RBF achieved a promising accuracy of 92.85% even without feature selection. Notably, employing BESO with PCC and SVM-RBF maintained this high accuracy. However, the highest overall accuracy of 97.14% was achieved when RDO was used for feature selection alongside PCC and SVM-RBF. These findings highlight the potential of feature extraction and selection techniques, particularly RDO with PCC, in improving the accuracy of DM detection using microarray gene data.

Insulated Gate Bipolar Transistor (IGBT) may convey high current and sustain high breakdown voltages; it may provide high power control. In a sense, how IGBT demonstrates the capability of power control was not specifically described, and the equivalent bipolar junction transistors (BJT) activated by an applied bias to the insulated gate is intriguing. As seen in Figure 1, IGBT shows an equivalent circuit structure containing two types of BJT, (NPN-type Bipolar transistor and PNP-type Bipolar transistor), which can be modeled as diode-associated transistor. Apparently, as a bias applies to the controlling gate, the channel beneath the gate oxide gets strongly inversed and turns out to be conductive just like what happens on metal-oxide-silicon field effect transistor (MOSFET), which provides necessary igniting currents to both BJTs and thus causes high current gain flowing through them-selves from the bottom. A proposed and renewed formula provides addressing the above scenario and successfully fitting the measured data that forms the characteristic curves. Some parameters in the proposed formula, which includes size and mobility associated constant, threshold voltage, and Early-Voltage-related lambda for MOSFET, explain and explore the underlying physics. IGBT thus enjoy high input impedance and high current gain due to MOSFET (Insulated Gate) and BJT, respectively. This formula combines both merits of MOSFET and BJT in order to fit the measured data. Indeed, the formula intimately fits IGBT electrical characteristic curves, and thus may be qualified and served as a model. The new model is then advisable for designing power integrated circuit to exactly achieve power saving, power control, and power efficiency.

This research aims to apply Artificial Intelligence (AI) methods, specifically Artificial Immune Systems (AIS), to design an optimal control strategy for a multivariable control plant. Two specific industrial control approaches are investigated: I-PD (Integral-Proportional Derivative) and PI-D (Proportional-Integral Derivative) control. The motivation for using these variations of PID controllers is that they are functionally implemented in modern industrial controllers, where they provide precise process control. The research results in a novel solution to the control synthesis problem for the industrial system. In particular, the research deals with the synthesis of I-P control for a two-loop system in the technological process of a distillation column. This synthesis is carried out using the AIS algorithm, which is the first application of this technique in this specific context. Methodological approaches are proposed to improve the performance of industrial multivariable control systems by effectively using optimization algorithms and establishing modified quality criteria. The numerical performance index ISE justifies the effectiveness of the AIS-based controllers in comparison with conventional PID controllers (ISE₁ = 1.865, ISE₂ = 1.56). The problem of synthesis of the multi-input multi-output (MIMO) control system is solved, considering the interconnections due to the decoupling procedure.

The relentless advancement and integration of mechanization and intelligence within the coal mining industry, combined with the increasing depths of mining operations, necessitate significantly higher safety standards. This necessity arises due to the increasingly complex geological and coal seam conditions encountered as mining operations delve deeper into the earth. Traditionally, 3D seismic exploration technology has been fundamental in ensuring both operational efficiency and safety in the coal mining sector. However, despite its critical role, this technology still has limitations in detecting and characterizing small-scale geological structures which can pose substantial risks if not accurately identified and mitigated. To address these challenges, this paper introduces a sparsity-constrained adaptive hard thresholding algorithm designed to tackle the spectral inversion optimization problem with an norm constraint for the enhanced retrieval of reflection coefficients, thereby establishing a comprehensive workflow for enhancing seismic data resolution through compressed sensing spectral inversion. Real data validation has demonstrated that this method significantly enhances the resolution of seismic data while maintaining the amplitude integrity and fidelity of the original signals. This improvement allows for a more detailed and accurate characterization of small-scale geological features, which are critical in identifying and mitigating potential hazards within coal mining operations, thus offering robust support for the implementation of more effective safety protocols and disaster prevention strategies in coal mines.

Google Trends data can be informative for infectious disease incidences, including Lyme disease. However, the use of Google Trends for predictive purposes is underutilized. In this study, we tested the ability of Google Trends search data to predict monthly state-level Lyme disease case counts in the United States. We requested Lyme disease data for the years 2010-2021. We downloaded Google Trends search data on terms for Lyme disease, symptoms of Lyme disease, and diseases with similar symptoms as Lyme disease. We built mixed negative binomial models based on a training dataset (2010-2016) and tested the models on a test dataset (2017-2021). A model was built for each search term and monthly lags of search terms were included as predictors. The highest performing models had high predictive ability, indicated by low Root Mean Squared Errors (RMSEs) and close association between observed and predicted case counts. The highest performing model was for the search term “Summer Flu”, which indicates low specificity of some of the terms. We outline challenges of using Google Trends data, including data availability and a mismatch between geographic units. We discuss opportunities for Google Trends data, including prediction of additional zoonotic diseases and incorporating environmental and companion animal data.

Gout is the most common form of inflammatory arthritis. Hyperuricaemia is the pre-requisite for gout and is influenced by variable modifiable and non-modifiable risk factors. Clinical features unique for gout are due to deposition of monosodium urate (MSU) crystal in articular and extra articular tissues. Among various treating agents, anti-inflammatory drugs and urate lowering therapies (ULT) are used widely and successfully, however, non-medicinal means are also effective in the disorder. In their updated guidelines, ACR (2012) and EULAR (2016) recommended both medicinal and non-medicinal approaches that could be used in treating gout, though some of the recommendations are based on lower level of evidence. Moreover, researchers’ continued effort in finding new gout managing agents appear promising, for example, role of Lesinurad in gout management (CLEAR1, CLEAR2). In this new synthesis the author is aimed to provide updated information on gout management based on a systematic review including published work within last ten years between 2008 and 2018 and for this purpose, using ‘clinical trials in gout management’ string, published worked searched in PubMed database from 1st September 2018 to 30 October 2018. Besides the recent ACR and EULAR evidence based management guidelines, the author reviewed another 91 (total 93) articles to make this new draft – 39 articles describe role of pharmacological agents and 54 describe different gout risks, pharmacokinetics/pharmacodynamics of ULT, association between raised sUA level and renal impairment, efficacy of non-pharmacological agents in reducing sUA. According to published work, anti-inflammatory agent is the most appropriate drug group in mitigating inflammatory symptoms of gout, though they often adversely affect over other vital 2 organs with impaired function. Besides ULT, uricase analogues are also found useful in non refractory gout. Since anti-inflammatory agents and ULT contraindicate in some clinical conditions, intra-articular steroid and or adrenocorticotropic hormone (ACTH) are appropriate alternatives instead. However, head-to-head comparison between different NSAIDs, NSAID and prednisolone, NSAID and colchicine are yet to perform. Use of combined anti-inflammatory preparations in gout is also based on lower level of evidence. Regarding effective maximum dose and long-standing impact of ULT on vital organs we are yet to reach a conclusion. Likewise, non-medicinal approaches are widely using in achieving target sUA level, though some of them are based on biased study outcomes and or study with inadequate power, requiring further analysis. Among non-pharmacological approaches, life-style modification, restriction of purine rich diets, avoidance of gout inciting agents are important, but inconclusive. Educating patients’ about diseases, risk factors, available treatment options and side effects from them are also important in terms of achieving sUA level, nevertheless too much counseling sometimes could be worthless.

This study addresses the formidable challenge of solving large-scale Max-Cut problems (MCP). We introduce a rapid computational procedure utilizing a hybrid 1-flip/r-flip local search heuristic. This innovative strategy significantly reduces the computational time required for MCP problems while consistently generating solutions of exceptional quality. The paper presents substantial computational insights, showcasing the effectiveness of our approach on large-scale Max-Cut instances with varying densities. Our proposed heuristic is rigorously evaluated by comparing its performance against a quantum annealing solver, leveraging a multi-start Tabu Search framework. The results underscore the potency of this unique combination as an efficient and effective solution for large-scale QUBO problems. Notably, our hybrid heuristic consistently delivers high-quality solutions within the stringent CPU time limits of 600 seconds, demonstrating its efficacy across Max-Cut instances ranging from 10,000 to 40,000 variables. This research contributes to advancing the state-of-the-art in large-scale QUBO problem-solving, offering a powerful and time-efficient approach with broad applicability.

We analyse the light curve in the R-band gathered during the 2015/16 observing season of OJ287. We did a search for QPOs using several methods in wide time domain. No statistically significant periods were found in the high frequency domain both in the ground data and also in K2 observations. In the longer periods domain the Lomb-Scargle periodogram revealed several peaks above the 99\% significance level. The longest one, about 95-day, corresponds to the ISCO period of the more massive SMBH. The 43-day period could be an alias or can be attributed to accretion in the form of two armed spiral wave.

Snow cover products are primarily derived from the Moderate-resolution Imaging Spectrometer (MODIS) and Advanced Very High-Resolution Radiometer (AVHRR) datasets. MODIS achieves both snow/non-snow discrimination and snow cover fractional retrieval, while early AVHRR-based snow cover products only focused on snow/non-snow discrimination. The AVHRR Climate Data Record (AVHRR -CDR) provides a nearly 40-year global dataset that has a potential to fill a gap in long term snow cover fractional monitoring. Our study selects the Qinghai-Tibet Plateau as the experimental area, utilizing AVHRR-CDR surface reflectance data (AVH09C1) and calibrating with MODIS snow product MOD10A1. The snow cover percentage retrieval from the AVHRR dataset is performed using Surface reflectance at 0.64μm (SR1) and Surface reflectance at 0.86μm (SR2), along with a simulated Normalized Difference Snow Index (NDSI) model. Also, in order to detect the effects of land cover type and topography on snow inversion, we tested the accuracy of the algorithm with and without these influences, respectively (vanilla algorithm & improved algorithm). The accuracy of the AVHRR snow cover percentage data product is evaluated using MOD10A1、 ground snow-depth measurements and ERA5. Results indicate that the logic model based on NDSI has the best fitting effect, with R-square and RMSE values of 0.83 and 0.10, respectively. Meanwhile, the accuracy was improved after taking into account the effects of land cover type and topography. The model is validated using MOD10A1 snow-covered areas, showing snow cover area differences of less than 4% across 6 temporal phases. Improved algorithm results in better consistency with MOD10A1 than vanilla algorithm. Moreover, the RMSE reaches greater levels when the elevation is below 2,000 meters or above 6,000 meters, and is lower when the slope is between 16° and 20°. Using ground snow-depth measurements as ground truth, the multi-year recall rates are mostly above 0.7, with an average recall rate of 0.81. Results also show a high degree of consistency with ERA5. The validation results demonstrate that the AVHRR snow cover percentage remote sensing product proposed in this study exhibits high accuracy in the Tibetan Plateau region, also demonstrating that land cover type and topographic factors are important to the algorithm. Our study lays the foundation for the global snow cover percentage product based on AVHRR-CDR，furthermore lays a basic work for generating a long-term AVHRR-MODIS fractional snow cover dataset.

Although the behavioral mechanism studying is a difficult and complex task, it can produce an important systems optimization impact. In this work, we use, in this paper, inference system approach to represent reasoning mechanism and the operations of dynamic systems to extract mental representations from traveling salesman and convert them into cognitive structures. For this we develop an extraction automatic method to create knowledge bases and, later, data are stocked into structure based on transition maps and the performances of these created maps get improved through combining the reinforcement learning thus augment traveller's deciding capacity from historical data. These transition maps help to find best actions for obtaining useful new policies. Generated intermediate transition maps are gathered to give a global map called main map whose advantage is to improve the learning process. The main idea of this approach is to improve learning capability by using a reinforcement learning technique as exploration and exploitation strategy of the metaheuristique GRASP method and the use of the fuzze logical rules mechanism allowing concepts model to have more variability of states. The results obtained after simulation as presented in this paper are very encouraging.

Rapid search and localization for nuclear sources can be an important aspect in preventing human harm from illicit material in dirty bombs or from contamination. In the case of a single mobile radiation detector, there are numerous challenges to overcome such as weak source intensity, multiple sources, background radiation, and the presence of obstructions, i.e., a non-convex environment. In this work, we investigate the sequential decision making capability of deep reinforcement learning in the nuclear source search context. A novel neural network architecture (RAD-A2C) based on the actor critic (A2C) framework and a particle filter gated recurrent unit for localization is proposed. Performance is studied in a randomized 20 x 20 m convex and non-convex environment across a range of signal-to-noise ratio (SNR)s for a single detector and single source. RAD-A2C performance is compared to both an information-driven controller that uses a bootstrap particle filter and to a gradient search (GS) algorithm. We find that the RAD-A2C has comparable performance to the information-driven controller across SNR in a convex environment and at lower computational complexity per action. The RAD-A2C far outperforms the GS algorithm in the non-convex environment with greater than 95% median completion rate for up to seven obstructions.

The challenge of this work is to re-define the concept of intelligent agent as a building block of social networks by presenting it as a physical particle with additional non-Newtonian properties. The proposed model of an intelligent agent described by a system of ODE coupled with their Liouville equation has been introduced and discussed. Following the Madelung equation that belongs to this class, non-Newtonian properties such as superposition, entanglement, and probability interference typical for quantum systems have been described. Special attention was paid to the capability to violate the second law of thermodynamics, which makes these systems neither Newtonian, nor quantum. It has been shown that the proposed model can be linked to mathematical models of livings as well as to models of AI. The model is presented in two modifications. The first one is illustrated by the discovery of a stochastic attractor approached by the social network; as an application, it was demonstrated that any statistics can be represented by an attractor of the solution to the corresponding system of ODE coupled with its Liouville equation. It was emphasized that evolution to the attractor reveals possible micro-mechanisms driving random events to the final distribution of the corresponding statistical law. Special attention is concentrated upon the power law and its dynamical interpretation: it is demonstrated that the underlying micro- dynamics supports a “violent reputation” of the power-law statistics. The second modification of the model of social network associated with a decision-making process and applied to solution of NP-complete problems known as being unsolvable neither by classical nor by quantum algorithms. The approach is illustrated by solving a search in unsorted database in polynomial time by resonance between external force representing the address of a required item and the response representing the location of this item.

Deadlock is a real problem that can cause expensive, time-dependent hang-ups or failures in distributed computing systems. Some studies have been conducted with deadlock detection and resolution in generalized request computing models, most of these studies are based on the diffusing computation scheme, where forward and backward propagated probe and reply messages respectively are diffused between dependent processes. The replies carry the dependency information between processes for the initiator. Using this dependency information initiator can detect and resolve the deadlock cycle. It has been proven in the literature that a deadlock cycle length distribution is skewed with a large majority of cycles (90%) having length two. Based on this fact an improved algorithm is proposed for handling deadlock detection in distributed computing systems under the distributed request model where each process has several requests at a time. The improved algorithm depends mainly on message propagation and timeout policy. Probe and reply messages are propagated between the initiator and its successors only to detect deadlock cycles between them. Global timeout policy is used to detect potential deadlock cycles with large length distribution. The proposed algorithm can handle concurrent executions. Simulation experiments are performed to see the effectiveness of the improved algorithm. It is found that the improved algorithm compares favorably with other existing algorithms and it shows better results for several performance metrics especially in reducing deadlock latency and execution time.

This paper presents a new semi-explicit algorithm for parameters estimation in a time-fractional generalization of dual-phase-lag heat conduction model with the Caputo fractional derivatives. It is shown that this model can be derived from a general linear constitutive relation for the heat transfer by conduction when the heat conduction relaxation kernel contains the Mittag-Leffler function. The model can be used to describe heat conduction phenomena in a material with power-law memory. The proposed algorithm of parameters estimation is based on the time integral characteristics method. The explicit representations of the thermal diffusivity and the fractional analogues of the thermal relaxation time and the thermal retardation are obtained via a Laplace transform of the temperature field and utilized in the algorithm. An implicit relation is derived for the order of fractional differentiation. In the algorithm, this relation is resolved numerically. An example illustrates the proposed technique.

Information taken from David A. Scott’s book “Copper and Bronze in Art” was crucial for research on copper corrosion products in Stuttgart. Examples discussed are the nature and variability of ‘Black Spots’ (aka ‘Brown Fuzzies’); cupric hydroxide by cleaning, patination, and pigment synthesis; the wondrous phenomenon of curly malachite; chalconatronite formed by contact to soda glass; the formation of copper formates by glass-induced metal corrosion; and synthesis and X-ray diffraction of basic copper acetates (‘verdigris’).

Detection of subsurface archaeological remains using a range of remote sensing methods, poses several challenges until today. Recent studies regarding the detection of archaeological proxies like those of cropmarks highlight the complexity of the phenomenon. In this work we present three different methods, and associated indices, for identifying stressed reflectance signatures indicating buried archaeological remains, based on a dataset of measured ground spectroradiometric reflectance. Several spectral profiles between the visible and near infrared part of the spectrum, were taken over a controlled environment in Cyprus during the 2011-2012 and are re-used in this study. The first two (spectral) methods are based on a suitable analysis of the spectral signatures in (1) the visible part of the spectrum, and in particular in the neighborhood of 570 nm, and (2) the red edge-near infrared part of the spectrum, in the neighborhood of 730 nm. Machine learning (decision trees) allows for the deduction of suitable wavelengths to focus on, in order to formulate the proposed indices and the associated classification criteria (decision boundaries) that can enhance the detection probability of stressed vegetation. Noise in the signal is taken into account by simulating reflectance signatures perturbed by white noise. Applying decision tree classification on the ensemble of simulations and basic statistical analysis we refine the formulation of the indices and criteria for the noisy signatures. The success rate of the proposed methods is over 90%. The third method rests on the estimation of vegetation/canopy reflectance parameters through inversion of the physical-based PROSAIL reflectance model and the associated classification through machine learning methods. The obtained results provide further insights into the formation of stress vegetation that occurred due to the presence of shallow buried archaeological remains, which are well aligned with physical-based models and existing empirical knowledge. To the best of the authors' knowledge, this is the first study demonstrating the usefulness of radiative transfer models such as PROSAIL for understanding the formation of cropmarks. Similar studies can support future research directions towards the development of regional remote sensing methods and algorithms if systematic observations are adequately dispersed in space and time.

Autonomous search is an ongoing cycle of sensing, statistical estimation and motion control with objective to find and localise targets in a designated search area. Traditionally, the theoretical framework for autonomous search combines the sequential Bayesian estimation with the information theoretic motion control. This paper formulates autonomous search in the framework of possibility theory. Although the possibilistic formulation is slightly more involved than the traditional, it provides means for quantitative modelling and reasoning in the presence of epistemic uncertainty. This feature is demonstrated in the paper in the context of partially known probability of detection, expressed as an interval value. The paper presents an elegant Bayes-like solution to sequential estimation, with the reward function for motion control defined to take into account the epistemic uncertainty. The advantages of the proposed search algorithm are demonstrated by numerical simulations.

Searching over a sorted list is a classical problem in computer science. Binary Search takes at most log2n+1 tries to find an item in a sorted list of size n. Interpolation Search achieves an average time complexity of Ο(loglogn) for uniformly distributed data. Hybrids of Binary Search and Interpolation Search are also available to handle data with unknown distributions. This paper analyzes the computation cost of these methods and shows that interpolation can significantly affect their performance — accordingly, a new method, Interpolation Once Binary Search (IOBS), is proposed. The experimental results show that IOBS outperforms the hybrids of Binary Search and Interpolation Search for nonuniformly distributed data.

The mission here is to see if we can find bound states for tachyons in some gravitational environment. That could provide an explanation for the phenomena called Dark Matter. Starting with the standard Schwarzschild metric in General Relativity, which is for a static and spherically symmetric source, it appears unlikely that such localized orbits exist. In this work the usual assumption of isotropic pressure is replaced by a model that has different pressures in the radial and angular directions. This should be relevant to the study of neutrinos, especially if they are tachyons, in cosmological models. We do find an arrangement that allows bound orbits for tachyons in a galaxy. This is a qualitative breakthrough. Then we go on to estimate the numbers involved and find that we do have a fair quantitative fit to the experimental data on the Galaxy Rotation Curve. Additionally we are led to look in the neighborhood of a Black Hole and there we find novel orbits for tachyons.

The level of ambiguity in describing glycan structure has significantly increased with the upsurge of large scale glycomics and glycoproteomics experiments. Consequently, an ontology-based model appears as an appropriate solution for navigating this data. However, navigation is not sufficient and the model should also enable advanced search and comparison. A new ontology with a tree logical structure is introduced to represent glycan structures irrespective of the precision of molecular details. The model heavily relies on the GlycoCT encoding of glycan structures. Its implementation in the GlySTreeM knowledge base was validated with GlyConnect data and benchmarked with the Glycowork library. GlySTreeM is shown to be fast, consistent, reliable and more flexible than existing solutions for matching parts of or whole glycan structures. The model is also well suited to painless future expansion. Availability:https://glyconnect.expasy.org/glystreem/wiki

The circular economy is an alternative paradigm whose purpose is the protection of the environment, the prevention of pollution and the growth of economic prosperity. This paper covers research which is qualitative in nature but has an exploratory scope through a documentary review, and includes proposals to promote sustainability. A more responsible consumption or use can be achieved by educating the user or consumer to return the product to production or repair through a collection service by way of reverse logistics (recovery of materials), followed by recycling or reuse of the product or its components to then offer these as recovered or recycled products on the market.

Environmental monitoring programs rely on periodic spot sampling at specific locations, followed by laboratory analysis, aiming at the evaluation of water quality at a catchment scale. For this purpose, automatic telemetric stations for specific parameters have been installed by the Institute of Marine Biological Resources and Inland Waters of Hellenic Centre for Marine Research (IMBRIW-HCMR) within several Greek rivers and lakes, providing continuous and temporal monitoring possibilities. Nevertheless, the employment of unmanned surface vehicles (USV) equipped with integrated sensors represents a tool valuable to several monitoring strategies, offering enhanced temporal and spatial coverage over specific timeframes, allowing for targeted examination of sites or events of interest. The USVs have been deployed by Athens Water and Sewerage Company (EYDAP) as a cost-effective tool for the environmental monitoring of surface water bodies of interest, with emphasis on the spatial fluctuations of chlorophyllα, electrical conductivity, dissolved oxygen and pH, observed in Koumoundourou Lake and rivers Acheloos, Asopos and Kifissos. The effectiveness of an innovative heavy metal (HM) system installed in the USV for thein situ determination of copper and lead was also evaluated herewith. The results obtained demonstrate that both the timely detection of potential pollution from both anthropogenic activities and natural processes as well as the monitoring of inland waters are made feasible through the employment of USV.

Amid the swift progression of the global automobile industry, the aspiration for lightweight vehicle design has surfaced as a crucial approach to boost fuel efficiency and curtail environmental impact. The objective of this study revolves around achieving holistic optimization of vehicle structure via detailed scrutiny of vehicle process characteristics, amalgamated with a Back Propagation neural network (BPNN) optimized by a genetic algorithm (GA) and a topology optimization (TO) method.The process initiates with an examination of the vehicle's technical characteristics, succeeded by an optimization protocol that couples GA with BPNN. This exhaustive optimization procedure derives the best-fit values of design parameters and identifies the globally optimal lightweight design approach. Subsequently, a comprehensive structural optimization is actualized by modifying the topological distribution of the structure.A simulation experiment of the conceptual car body beam skeleton is conducted as a conclusive step, and the anti-collision capacity of the car body beam skeleton is assessed by measuring deformation intrusion. The findings reveal that in the vehicle topology optimization, a comparative analysis of pre and post-optimization results indicates an improved topological density across diverse sections. The topological density of the vehicle's frontal structure escalates from 0.75 to 0.8. Following optimization, the stiffness assessment records a marginal increase (within the range of 0.02–0.05), implying that the lightweight design does not compromise the general rigidity of the structure.The optimized body structure manifests superior crashworthiness in the crash test: the deformation intrusion diminishes by 27% in front-end collisions. In side impacts, the deformation and intrusion at critical points are reduced by 13.15% to 10% respectively. The comprehensive method proposed herein proves to be an efficient strategy to actualize the lightweight design of vehicles.

In the Internet of Things (IoT) era, Mobile Edge Computing (MEC) significantly enhances the efficiency of smart devices but is limited by battery life issues. Wireless Power Transfer (WPT) addresses this issue by providing a stable energy supply. However, effectively managing overall energy consumption remains a critical and under-addressed aspect for ensuring the network’s sustainable operation and growth. In this paper, we consider a WPT-MEC network wit user cooperation to migrate the double near-far effect for the mobile node (MD) far from the base station. We formulate the problem of maximizing long-term computation rates under a power consumption constraint as a multi-stage stochastic optimization (MSSO) problem. This approach is tailored for a sustainable WPT-MEC network, considering the dynamic and varying MEC network environment, including randomness in task arrivals and fluctuating channels. We introduce a virtual queue to transform the time-average energy constraint into a queue stability problem. Using the Lyapunov optimization technique, we decouple the stochastic optimization problem into a deterministic problem for each time slot, which can be further transformed into a convex problem and solved efficiently. Our proposed algorithm works efficiently online without requiring further system information. Rigorous mathematical analysis shows that our algorithm achieves O(1/V),O(V) trade-off between computation rate and queues stability. Extensive simulation results demonstrate that our proposed algorithm outperforms baseline schemes, achieving approximately 4% enhancement while maintain the queues stability.

Count data analysis presents unique challenges due to its discrete nature, often exhibiting excessive zeros and overdispersion. To address these complexities, count models, such as Poisson regression and Negative Binomial regression, have been developed, enabling modeling and prediction of count-based phenomena. Additionally, it’s important to notice that zero inflation, a phenomenon commonly observed in count data, requires specialized techniques for robust analysis. This article provides an overview of count data and count models, explores zero inflation, introduces Likelihood Ratio Tests, and explains how the Vuong Test can be used as a model selection criteria. Furthermore, we created a Vuong Test implementation from scratch using the Python programming language. This implementation enhances the accessibility and applicability of the Vuong Test in real-world scenarios, providing a valuable contribution to the academic community, since Python didn’t have an implementation of this statistical test.

Systemic Lupus Erythematosus (lupus) and B-cell lymphoma (lymphoma) are serious diseases. Lupus and lymphoma co-occur at higher-than-expected rates and primarily depend on B-cells for their pathology, implicating shared inflammation-related B-cell molecular mechanisms as a potential cause of co-occurrence. We consequently implemented a novel Immune Imbalance Transcriptomics (IIT) algorithm and applied IIT to lupus, lymphoma, and healthy B-cell RNA-seq data to find shared- and contrasting mechanisms potentially targetable for treatment. We observed 8,562 genes significantly dysregulated in both lupus and lymphoma. Of those genes, we found 5,335 to have a significant immune imbalance, defined as significant dysregulation by both diseases, as determined by IIT. Gene Ontology (GO) term and pathway enrichment of IIT genes yielded immune-related “Neutrophil Degranulation” and “Adaptive Immune System”, validating that the IIT algorithm isolates biologically relevant genes in immunity and inflammation. We found that 389 IIT gene products are drug-targetable with established or repurposed drugs. Among our results, we found 40 known and 349 novel lupus targets, along with 151 known and 238 novel lymphoma targets. Known disease drug targets in our IIT results further validate that IIT isolates genes with disease-relevant mechanisms. We anticipate the IIT algorithm and shared and contrasting gene mechanisms uncovered here will contribute to the development of immune-related therapeutic options for lupus and lymphoma patients.

Hyperspectral imaging, a rapidly evolving technique, furnishes exhaustive information on Earth's surface reflectance over an extensive spectrum of wavelengths. We have developed a more precise method for analyzing spectral data by meticulously selecting plant leaf pixels and employing a relative reference approach. This enhanced technique correlates camera pixel values with light intensity, bypassing the need for complex equations and thereby providing clearer insights into vegetation vitality. The findings of this study not only enhance the precision of hyperspectral imaging but also bolster our capability for ecological monitoring and understanding environmental health. A novel algorithm based on the red-edge slope was established to classify images, exploiting the spectral reflectance data gleaned from the hyperspectral Liquid Crystal Tunable Filter (LCTF) camera. Compared with conventional SVM and K-means algorithms, our novel algorithm demonstrated commendable performance, achieving an overall accuracy of 90% with a Kappa Coefficient of 0.86. This comparison highlights the novel algorithm's relative strength and potential for large-scale satellite and drone imagery analysis applications. The advancements facilitated by this research are instrumental in ecological assessments, conservation efforts, and resource management strategies, signaling a leap forward in the era of environmental monitoring and analysis.

This study presents a groundbreaking approach in the field of gaming AI, focusing on the classic game” Pacman” through the lens of DRL integrated with advanced optimization techniques. The core of the research involves adapting DRL models for” Pacman”, utilizing the ESO for hyper- parameter tuning. These novel adaptations significantly enhance the AI agent’s performance, demonstrating a remarkable improvement in adaptability, responsiveness, and efficiency within the game environment. A pivotal aspect of this research is the innovative integration of metaheuristic optimization techniques into the DRL framework, a first in the domain of Atari gaming AI. This integration has proven essential in fine-tuning the DRL models, leading to a more effective and dynamic gaming experience. The study thoroughly evaluates and compares the performance of these algorithms, providing empirical support for their effectiveness and setting a new benchmark in AI-driven game development. The implications of this research extend beyond gaming AI, opening up possibilities for future exploration in several directions. Expanding DRL models to other complex gaming environments, continuous algorithmic enhancements, real-time learning adaptations, and applying these principles to robotics and autonomous vehicles are examples. The research also emphasizes ethical and responsible AI use in gaming to address fairness and addiction issues.

Gaze tracking of high-speed moving targets is a novel application mode for low Earth orbit microsatellites. In this mode, small satellites are equipped with high-resolution narrow-field-of-view video cameras for stable gaze-tracking imaging of high-speed moving targets. This paper proposes a high-precision attitude adaptive integral sliding mode control method with a feedforward compensation disturbance observer to enhance the capability of a microsatellite attitude control system for gaze tracking of high-speed moving targets. Specifically, first, we present the attitude control system model for microsatellites and the calculation method for the desired attitude of target tracking based on image feedback. Then, an adaptive integral sliding mode attitude control algorithm with a feedforward compensation disturbance observer, which meets the requirements of high-precision tracking control, is designed. The developed algorithm utilizes the disturbance observer to observe the friction torque of the flywheel and compensates for it through feedforward control. It also employs the adaptive integral sliding mode control algorithm to reduce the impact of uncertain disturbances, decrease the steady-state error of the system, and enhance the attitude control precision. Simulation experiments demonstrated that the designed disturbance observer can successfully observe the frictional disturbance torque of the flywheel. The attitude Euler angle control precision for high-speed moving target tracking reached 0.009°, and the angular velocity control precision reached 0.005°/s, validating the effectiveness of the proposed approach.

This study introduces a novel algorithm tailored for the precise detection of lower outliers in univariate datasets, particularly suited for scenarios with a single cluster. The approach leverages a combination of transformative techniques and advanced filtration methods to efficiently segregate anomalies from normal values. Notably, the algorithm emphasizes high precision, ensuring minimal false positives, and requires only a few parameters for configuration. Its unsupervised nature enables robust anomaly filtering without the need for extensive manual intervention. To validate its efficacy, the algorithm is rigorously tested using real-world data obtained from photovoltaic (PV) module strings with similar DC capacities, containing various anomalies. Results demonstrate the algorithm's capability to accurately identify lower outliers while maintaining computational efficiency and reliability in practical applications.

This work presents a new algorithm to resolve the problem of distribution network reconfiguration using the Tabu Search metaheuristic and voltage drop. The proposed method presents a different way to obtain the initial solution using the voltage drop, as well as a new way to generate a neighborhood of candidate solutions, based on randomness and the voltage drop, to perform a smooth and steady descent execution of the algorithm. The proposed algorithm has the main objective to reduce the active power losses in distribution networks, but it also achieves an refinement in the voltage profile. The proposed method was tested in two distribution systems, the 33-Bus and 94-Bus systems, commonly found and tested in the literature. The results of the tests show that the proposed method presents a low computational cost, achieves good solutions, and is better than the other methods found in the literature.

Aiming at the APF algorithm in the collision-free path planning and LQR algorithm tracking process, there are problems such as unreachable target points, local optimization, low safety coefficient of autonomous lane change collision avoidance tracking control and poor stability, this paper proposes an optimized APF method, which solves the defects of the traditional artificial potential field method by adding the distance adjustment factor, the safety distance protection model and the sub-target virtual potential field, and at the same time generates the autonomous driving car collision-free path. The path tracking control system is designed based on feed-forward control and DLQR controller, in which the vehicle dynamics state space model is used as the basis, the model is linearized and discretized, and the corresponding constraint variables are set to minimize the control command objective cost function under the constraints, and the objective of the DLQR controller.The objective is to accurately determine the steering angle in order to achieve path tracking and eliminate the lateral error between the reference path and the actual path caused by external interference.Finally, the simulink model and CarSim parameter configuration joint simulation platform are built, and different obstacle scenarios and different speeds are selected for collision-free path planning and tracking motion simulation research and analysis, which verifies the accuracy and practicability of the algorithm, and shows more obvious advantages in obstacle avoidance ability, path smoothing degree, and collision avoidance safety stability. The ideas proposed in this paper are expected to be further extended and popularized to actual path planning problems, which has important practical significance and engineering value.

This study investigated the effects of icon familiarity on visual search performance. An equal number of familiar and unfamiliar icons were selected as background icons. These background icons were randomly arranged, and a visual search experiment was conducted to locate the target icon. The results showed no significant difference in the time required to find the target icon, regardless of whether the target icon was familiar or unfamiliar. This finding contrasts with previous studies that have suggested a positive effect of target icon familiarity on visual search performance, indicating that the influence of target icon familiarity may not always be consistent and could depend on the characteristics of the background icons. However, when background icons were grouped based on their familiarity, the time taken to locate the target icon was significantly reduced compared to when the icons were randomly arranged. To understand the underlying mechanism of this effect, participants' gaze fixation times were observed. The results revealed that participants spent more time fixating on areas where the target icon was located, rather than on areas without the target icon, suggesting a more efficient visual search process. Moreover, the shorter the visual search time, the higher the proportion of time spent fixating on the area containing the target icon. Additionally, this study examined the contrast ratio between the color of the background space and the dominant color of the target icon, comparing it with the visual search time. The findings indicated that as the contrast ratio increased, the visual search time decreased.

Objective To assess the quality and readability of online information on holmium laser enucleation of the prostate in management of benign prostate hyperplasia using the most used search engine worldwide, google. Methods The google search term “Holmium laser surgery” and “enlarged prostate” was used and the initial 150 webpages were reviewed. Webpages that were paywall, scientific literature, and/or promoted advertisements were excluded. Quality assessment tools - DISCERN, QUEST, and JAMA criteria were used, while readability tools like FKG, GFI, SMOG, and FRE score were used. Two authors independently reviewed the included sites for further analysis; for any discrepancy, a third author would be involved. Results 107 webpages were included in the data analysis. The median DISCERN score was 42 out of 80 (IQR 35-49). The median JAMA score was 0 out of 4 (IQR 0-1). The median QUEST score was 9 out of 28 (IQR 9-12). Using the non-parametric ANOVA and post-hoc test, significant differences were identified between rankings of webpages. Sponsorship had no influence on quality of webpages. Overall readability level required a minimum reading level of grade 11. Linear regression analysis showed a higher rank webpage is a positive predictor for all three quality assessment tools. Conclusion The overall quality of online information regarding HoLEP is poor. We identify that top ranked google searches have a higher DISCERN score and is a positive predictor for DISCERN/QUEST/JAMA. Quality online information can be used to benefit patients but should be used in conjunction with consultation from a medical professional.

Hydrocephalus is caused by an overproduction of cerebrospinal fluid (CSF), a blockage of fluid circulation, or improper reabsorption. CSF accumulation in the brain’s ventricles causes ventriculomegaly and brain cell damage. Hydrocephalus can be caused by brain trauma, hemorrhage, infection, tumors, or genetic mutations. Currently, there is no cure for hydrocephalus. Treatments like shunting and endoscopic third ventriculostomies are used, but unfortunately, these techniques require brain surgery and have high failure rates. To advance the development of hydrocephalus treatments, physiologically relevant pre-clinical models are crucial. This review covers some of the current animal and cell culture methods used to study hydrocephalus. The choroid plexus epithelium (CPe) is thought to be the major producer of CSF in the brain. It is a polarized epithelium that regulates ion and water movement from a fenestrated capillary exudate to the ventricles. Despite decades of research, control of electrolyte movement in the CPe is still not fully understood. This review discusses important transporters on the CPe and how some of these could be potential targets for hydrocephalus treatment.

Navigation systems are considered as a fast and efficient source of road information to drivers. However, they can distract drivers with more potential accidents on the road. This study examined the effect of navigation systems on driver distraction and visual search while driving in different driving conditions. An eye-tracking system was used to collect visual search data from twenty young drivers while using a driving simulator. Several factors were investigated, including the driving environment (urban and rural), the illumination level (day and night), and the display of the navigation system (large and small) as well as their interactions. Several measures related to eye movements were used in this experiment, including percentage of total Global Positioning System (GPS) fixation duration, average duration of GPS fixation, GPS fixation frequency, the percentage of total dwell duration for the road ahead, the frequency of dwelling on the mirrors and driver’s right and left side windows, and the percentage of dwellings on the mirrors and driver’s right and left side windows. Statistical analysis of the collected data was performed with repeated measures analysis of variance (ANOVA). The experiment revealed that the small GPS display creates more distraction in terms of average gaze duration and total gaze duration. Moreover, daytime driving conditions increase distraction. Regarding the driver’s visual search, the study showed that the visual search area is wider and more spread out during the day, which leads to better driving performance. This study will compare small and large navigation displays to determine which one is more effective in reducing driver distractions, and contribute to understanding driver distraction and visual search while using the navigation system display.

ABSTRACT Background Ubiquitination plays an important role in protein post-translational processes and has been found to be involved in a number of regulatory functions including proteasome degradation, DNA repair, transcription, signal transduction, endocytosis, and sorting. As the identification of ubiquitination site is critical to furthering our understanding of the mechanism of ubiquitination, various experimental and machine learning methods have been used to conduct this task. It has been an important but challenging task to improve the accuracy of ubiquitination site prediction. In this research, we explore the possibility of improving the prediction performance of machine learning by incorporating grid search in the training process. Method We developed grid search procedures for each of six widely used machine learning methods including NB, LR, DT, SVM, LASSO, and KNN, and applied them to ubiquitination site prediction using the six PCP datasets that were previously developed. For each of the ML methods, we developed a set of values for each of the tunable hyperparameters available to the method. These sets of values then can be combined to form a large grid of hyperparameter settings, and each of these settings is used in the grid search. We integrated 5-fold cross-validation in grid search to train and test ML models and applied an additional independent validation procedure by conducting a pre-training 80-20 sample split. We evaluated the performance of the six methods by comparing them side by side for each of the six datasets. We also compared the grid search results with the results that were previously published without doing grid search. To optimize the prediction performance, we trained 1.1 million ML models in total through grid search. Results We compared the overall prediction performance of these six methods, as well as their prediction performance when working with balanced vs. imbalanced data, and large-scale vs. small-scale data. From the perspective of dataset, we find that the overall performance of every PCP dataset has been significantly improved in this study compared to the previous study, with the percentage increase of the average AUC of all six datasets ranging from 7.9% (PCP-4) up to 17.0% (PCP-1). From the perspective of method, we find that three out of four methods significantly benefit from grid search comparing to their previously published non-grid search results, with the maximum AUC improvement as high as 47% (LASSO on PCP-5), 43.3% (NB on PCP-1), and 33.7% (SVM on PCP-6). SVM overall ranks number one, followed by KNN as the number two performer based on their average AUCs on all datasets. But these two also ranked the top two (KNN 76 days and SVM 15 days) in terms of the total running time that they need to do grid search. We also find that SVM, KNN, and DT tend to handle small-scale and imbalanced datasets better, while LR, and LASSO are doing well with large-scale and balanced datasets. NB is more sensitive to data imbalance while less sensitive to the size of a dataset. Conclusions Our results show that using grid search has improved the performance of ubiquitination prediction significantly. We find that the performance of a method is closely related to its hyperparameter setting and the type of data it handles. Even though SVM is on average an outperformer, none of the methods can provide the best performance for all datasets. When sufficient computing resources are well accessible, grid search is an effective way to identify both a top performing model for a machine learning method and a suitable machine learning method for a particular dataset.

The weight coefficients of the diaphragm spring depend on experiences in the traditional optimization. However, this method not only cannot guarantee the optimal solution but it is also not universal. Therefore, a new optimization target function is proposed. The new function takes the minimum of average compress force changing of the spring and the minimum force of the separation as total objectives. Based on the optimization function, the result of the clutch diaphragm spring in a car is analyzed by the non-dominated sorting genetic algorithm (NSGA-II) and the solution set of Pareto is obtained. The results show that the pressing force of the diaphragm spring is improved by 4.09%by the new algorithmand the steering separation force is improved by 6.55%, which has better stability and steering portability. The problem of the weight coefficient in the traditional empirical design is solved. The pressing force of the optimized diaphragm spring varied slightly during the abrasion range of the friction film, and the manipulation became remarkably light.

Accurate forecasting of icing thickness has a great significance for ensuring the security and stability of power grid. In order to improve the forecasting accuracy, this paper proposes an icing forecasting system based on fireworks algorithm and weighted least square support vector machine (W-LSSVM). The method of fireworks algorithm is employed to select the proper input features with the purpose of eliminating the redundant influence. In addition, the aim of W-LSSVM model is to train and test the historical data-set with the selected features. The capability of this proposed icing forecasting model and framework is tested through the simulation experiments using real-world icing data from monitoring center of key laboratory of anti-ice disaster, Hunan, South China. The results show that the proposed W-LSSVM-FA method has a higher prediction accuracy and it may be a promising alternative for icing thickness forecasting.

Background. Keyword co-occurrence analysis is a crucial tool for comprehending research trends, identifying relevant studies, and gaining insight into the connections between various concepts and topics. Objective. This study focuses on analyzing the co-occurrence of keywords using FP-growth algorithm and direct search methods. Materials and methods. The methodology involved extracting bibliometric data of Energies journal for 2023-2024 from MDPI publisher platform, keyword lemmatization and keyword co-occurrence estimation. Clustering and visualization were performed using Multidendrograms and Scimago Graphica software. Results. The results showed that the FP-growth algorithm can achieve a close match with the direct search results, which facilitates data preparation for clustering. In addition, finding the co-occurrence of three or more keywords significantly reduced the number of possible combinations, which allowed the identification of specific research topics. Conclusions. This study highlights the usefulness of the FP-growth algorithm in keyword analysis and provides insights into ways to refine search queries to abstract databases for the purpose of designing and writing literature and systematic reviews.

In order to search possible residual minor phases in Y-Ba-Cu-O family, powdered mixtures of Y₂O₃ + BaCO₃ + CuO and, independently, superconducting compound YBa₂Cu₃O_7-x have been treated in evacuated cells and elevated temperatures.YBa₂Cu₃O_7-x was reduced to YBa₂Cu₃O₅ by use of the special home designed Taconis-Knudsen vacuum device. A subsequent doping by oxygen converts produced insulator YBa₂Cu₃O₅ to semiconductor or metal YBa₂Cu₃O_5+x (0<x<0.3). In addition to YBa₂Cu₃O₅, 0.05 volume percent of the minor delafossite phase Y₂Cu₂O₄ was being spotted in the powder mixture 1/2 Y₂O₃ + 2BaCO₃+6Cu₂O, heated up to 818 °C in an inert gas atmosphere. An attempt to prepare the insulating bulk delafossite samples was successful, and subsequent doping by oxygen produces novel metallic phases.

Facial emotion detection is a challenging task that deals with emotion recognition. It has applications in various domains, such as behavior analysis, surveillance systems and human-computer interaction (HCI). Numerous studies have been implemented to detect emotions, including classical machine learning algorithms and advanced deep learning algorithms. For the machine learning algorithm, the hand-crafted feature needs to be extracted, which is a tiring task and requires human effort. Whereas in deep learning models, automated feature extraction is employed from samples. Therefore, in this study, we have proposed a novel and efficient deep learning model based on Neural Architecture Search Network utilizing superior artificial networks such as RNN and child networks. We performed the training utilizing the FER 2013 dataset comprising seven classes: happy, angry, neutral, sad, surprise, fear, and disgust. Furthermore, we analyzed the robustness of the proposed model on CK+ datasets and comparing with existing techniques. Due to the implication of reinforcement learning in the network, most representative features are extracted from the sample network. It extracts all key features without losing the key information. Our proposed model is based on one stage classifier and performs efficient classification. Our technique outperformed the existing models attaining an accuracy of 98.14%, recall of 97.57%, and precision of 97.84%.

Over the past decade, Knowledge bases (KB) have been increasingly utilized to complete and enrich the representation of queries and documents in order to improve the document retrieval task. Although many approaches have used KB for such purpose, understanding how effectively lev-erage entity-based representation still needs to be resolved. This paper proposes a Purely Enti-ty-based Semantic Search Approach for Information Retrieval (PESS4IR) as a novel solution. The approach includes (i) its own entity linking method, (ii) an inverted indexing method, and for document retrieval and ranking, (iii) an appropriate ranking method is designed to take advantage of all the strengths of the approach. We report the findings on the performance of our approach tested by queries annotated by two known entity linking tools, REL and DBpedia-Spotlight. The experiments are performed on the standard TREC 2004 Robust and MSMARCO collections. By using the REL method, for queries whose all terms are annotated and whose average annotation scores are greater than or equal to 0.75, our approach achieves the maximum nDCG@5 score (1.000). Thus, using our approach with any other document retrieval method would be an added value, unless that method achieves the maximum nDCG@5 score for those highly annotated queries.

The minimum dominating tree (MDT) problem consists of finding a minimum weight sub-graph from an undirected graph, such that each vertex not in this sub-graph is adjacent to at least one of the vertices in it, and the sub-graph is connected without any ring structures. This paper presents a Dual Neighborhoods Search (DNS) algorithm for solving the MDT problem, which integrates several distinguishing features, such as two neighborhoods collaboratively working for optimizing the objective function, a fast neighborhood evaluation method to boost the searching effectiveness, and several diversification techniques to help the searching process jump out of the local optimum trap thus obtaining better solutions. DNS improves the previous best-known results for 4 public benchmark instances while providing competitive results for the remaining ones. Several ingredients of DNS are investigated to demonstrate the importance of the proposed ideas and techniques.

In the present-day digital landscape, websites have increasingly relied on digital marketing practices, notably search engine optimization (SEO), as a vital component in promoting sustainable growth. The traffic a website receives directly determines its development and success. As such, website owners frequently engage the services of SEO experts to enhance their website's visibility and increase traffic. These specialists employ premium SEO audit tools that crawl the website's source code to identify structural changes necessary to comply with specific ranking criteria, commonly called SEO factors. Working collaboratively with developers, SEO specialists implement technical changes to the source code and await the results. The cost of purchasing premium SEO audit tools or hiring an SEO specialist typically ranges in the thousands of dollars per year. Against this backdrop, this research endeavors to provide an open-source Python-based Machine Learning SEO software tool to the general public, catering to the needs of both website owners and SEO specialists. The tool analyzes the top-ranking websites for a given search term, assessing their on-page and off-page SEO strategies, and provides recommendations to enhance a website's performance to surpass its competition. The tool yields remarkable results, boosting average daily organic traffic from 10 to 143 visitors.

A thermal load dispatch problem minimizes the number of objectives viz operating cost and emission of gaseous pollutants together while allocating the power demand among the committed generating units subject to physical and technological system constraints. A stochastic thermal load dispatch problem is undertaken while taking into consideration, the uncertainties, errors in data measurements and nature of load demand which is random. Owing to uncertain load demand, variance due to mismatch of power demand termed as risk, is considered as another conflicting objective to be minimized. Generally multiobjective problems generate a set of non-inferior solutions are generated and supplied to a decision maker to select the best solution from the set of non-inferior solutions. This paper proposes opposition-based greedy heuristic search (OGHS) method to generate a set of non-inferior solutions. Opposition-based learning is applied to generate initial population to select good candidates. Migration to maintain diversity in the set of feasible solutions is also based on opposition-based learning. Mutation strategy is implemented by perturbing the genes heuristically in parallel and better one solution is sought for each member. Feasible solutions are achieved heuristically by modifying the generation-schedules in such a manner that violation of operating generation limits are avoided. The OGHS method is simple to implement and provides global solutions derived from the randomness of the population generated without tuning of parameters. Decision maker exploits fuzzy membership functions to decide the final decision. Validity of the method has been demonstrated by analysing systems in different scenarios consisting of six generators and forty generators.

The paper aims to illustrate the different roles that social sciences can play in the study of the energy transition. To this end, a scheme is developed that frames the relative position of the social sciences with respect to other disciplines (metaframe). Secondly, socialization is identified as a charismatic category capable of providing an original, typically sociological contribution to the complex and hesitant energy transition (masterframe)

On the basis of a limited number of reasonable axioms, we discuss the classification of all the possible universality classes of diffeomorphisms invariant metric theories of quantum gravity. We use the language of the renormalization group and adopt several ideas which originate in the context of statistical mechanics and quantum field theory. Our discussion leads to several ideas that could affect the status of the asymptotic safety conjecture of quantum gravity and give universal arguments towards its proof.

Protein-DNA interactions are critical for the successful functioning of all natural systems. The key role in these interactions is played by processes of protein search for specific sites on DNA. Although it has been studied for many years, only recently microscopic aspects of these processes became more clear. In this work, we present a review on current theoretical understanding of the molecular mechanisms of the protein target search. A comprehensive discrete-state stochastic method to explain the dynamics of the protein search phenomena is introduced and explained. Our theoretical approach utilizes a first-passage analysis and it takes into account the most relevant physical-chemical processes. It is able to describe many fascinating features of the protein search, including unusually high effective association rates, high selectivity and specificity, and the robustness in the presence of crowders and sequence heterogeneity.

P-band radar remote sensing applied during the Airborne Microwave Observatory of Subcanopy and Subsurface (AirMOSS) mission has shown great potential for estimation of root zone soil moisture. When retrieving the soil moisture profile (SMP) from P-band radar, a mathematical function describing the vertical moisture distribution is required. Because only a limited number of observations are available, the number of free parameters of the mathematical model must not exceed the number of observed data. For example, a second order polynomial that contains 3 free parameters was presumed based on in-situ SMP data. The polynomial is currently parameterized based on 3 backscatter observations provided by AirMOSS (i.e. one frequency at three polarizations of HH, VV and HV). In this paper, a more realistic, physically-based SMP model containing 3 free parameters is derived based on a solution to Richards’ equation for unsaturated flow in soils. Evaluation of the new SMP model based on both numerical simulations and measured data revealed that it exhibits greater flexibility for fitting measured and simulated SMPs than the currently applied polynomial. It is also demonstrated that the new SMP model can be reduced to a second order polynomial at the expense of fitting accuracy.

Flexible implementations of Monte Carlo Tree Search (MCTS), combined with domain specific knowledge and hybridization with other search algorithms, can be a very powerful for the solution of problems in complex planning. We introduce mctreesearch4j, a standard MCTS implementation written as a standard JVM library following key design principles of object oriented programming. We define key class abstractions allowing the MCTS library to flexibly adapt to any well defined Markov Decision Process or turn-based adversarial game. Furthermore, our library is designed to be modular and extensible, utilizing class inheritance and generic typing to standardize custom algorithm definitions. We demon- strate that the design of the MCTS implementation provides ease of adaptation for unique heuristics and customization across varying Markov Decision Process (MDP) domains. In addition, the implementation is reasonably performant and accurate for standard MDP’s. In addition, via the implementation of mctreesearch4j, the nuances of different types of MCTS algorithms are discussed.

This article introduces a novel nature-inspired metaheuristic algorithm called Frilled Lizard Optimization (FLO), which emulates the hunting behavior of frilled lizards in their natural habitat. FLO draws in-spiration from the sit-and-wait strategy observed in frilled lizards during hunting. The underlying theory of FLO is presented and mathematically formulated in two phases: (i) an exploration phase, simulating the frilled lizard's attack towards prey, and (ii) an exploitation phase, simulating the lizard's retreat to the top of the tree after feeding. To assess FLO's efficacy in solving optimization problems, the algorithm's performance is evaluated across fifty-two standard benchmark functions, encompassing unimodal, high-dimensional multimodal, fixed-dimensional multimodal, and the CEC 2017 test suite. Comparative analyses with twelve existing metaheuristic algorithms are conducted. The simulation results reveal that FLO, distinguished by its adeptness in exploration, exploitation, and balancing them during search process, outperforms competing algorithms. Additionally, FLO is implemented on twenty-two constrained optimization problems from the CEC 2011 test suite and four engineering design problems, demonstrating its effectiveness in addressing real-world optimization applications.

Extreme-mass-ratio inspirals (EMRIs) are significant observational targets for spaceborne gravitational wave detectors, namely, LISA, Taiji, and Tianqin, which involve the inspiral of stellar-mass compact objects into massive black holes with a mass range of approximately 104∼107M⊙. EMRIs are estimated to produce long lived gravitational wave signals with more than 105 cycles before plunge, making them an ideal laboratory for exploring the strong-gravity properties of the spacetimes around the MBHs, stellar dynamics in galactic nuclei, and properties of the MBHs itself. However, the complexity of the waveform model, which involves the superposition of multiple harmonics, as well as the high-dimensional and large-volume parameter space, make the fully coherent search challenging. In our previous work, we proposed a 10-dimensional search using Particle Swarm Optimization (PSO) with local maximization over the three initial angles. In this study, we extend the search to an 8-dimensional PSO with local maximization over both the three initial angles and the angles of spin direction of the MBH where the latter contribute a time independent amplitude to the waveforms. Additionally we propose a 7-dimensional PSO search by using a fiducial value for the initial orbital frequency and shifting the corresponding 8-dimensional Time Delay Interferometry responses until a certain lag returns the corresponding 8-dimensional log-likelihood ratio maximum. The reduced dimensionality likelihoods enable us to successfully search for EMRI signals with duration of 0.5 years and signal-to-noise ratio of 50 within a wider search range than our previous study. We discuss further developments, such as using a hierarchical search to narrow down the search ranges of certain parameters, and applying Graphics Processing Units to speed up the code. These advances aim to improve the efficiency and accuracy of the EMRI search algorithm.

Photogrammetry involves aerial photography of the earth’s surface and subsequently processing the images to provide a more accurate depiction of the area (Orthophotography). It’s used by the Spanish Instituto Geográfico Nacional to update road cartography but requires a significant amount of manual labor due to the need to perform visual inspection of all tiled images. Deep Learning techniques (artificial neural networks with more than one hidden layer) can perform road detection but it is still unclear how to find the optimal network architecture. Our system applies grammar guided genetic programming to the search of deep neural network architectures. In this kind of evolutive algorithm all the population individuals (here candidate network architectures) are constrained to rules specified by a grammar that defines valid and useful structural patterns to guide the search process. Grammar used includes well-known complex structures (e.g. Inception-like modules) combined with a custom designed mutation operator (dynamically links the mutation probability to structural diversity). Pilot results show that the system is able to design models for road detection that obtain test accuracies similar to that reached by state of the art models when evaluated over a dataset from the Spanish National Aerial Orthophotography Plan.

In this paper, we examine the performance of several classifiers in the process of searching for very negative opinions. More precisely, we do an empirical study that analyzes the influence of three types of linguistic features (n-grams, word embeddings, and polarity lexicons) and their combinations when they are used to feed different supervised machine learning classifiers: Support Vector Machine (SVM), Naive Bayes (NB), and Decision Tree (DT).