In the case of indigenous grapevine varieties, the aim of clonal selection is twofold: to improve their technological cultivation problem while preserving the varietal character. As the sensitivity of perennial crops to climate change becomes more pronounced, clonal selection, which is already very time-consuming for perennial woody crops, may take even longer. In Badacsony, clonal selection breeding of the ‘Kéknyelű’ and ‘Juhfark’ varieties was started in the early 2000s. The problem mentioned above in cultivation technology is the poor fertility of ‘Kéknyelű’ (functionally female-flowered variety), while in the case of ‘Juhfark’ the high susceptibility to grey rot (Botrytis). Based on 11 years of data significant difference in yield between clone B.2. and the base variety was found. In this comparison the year clusters also gave different values, as in years belonging to cluster 1 the ’Kéknyelű’ yielded more than in another year. Both clones of ‘Kéknyelű’ matured with significantly lower pH compared to the base variety. ‘Kéknyelű' is renowned for the distinctive variety character of its wine, which is said to be acidic. Given the acidic nature of ‘Kéknyelű’ wine and the expected increase in must degrees and pH due to climate change, these distinctions may be beneficial in the future. Daily meteorological parameters were also recorded in the years under study, and different indexes were calculated for both of varieties for different phenological periods. The years were classified into 3 clusters and the harvest data were analyzed within each cluster. In the case of 'Kéknyelű' our results revealed significant differences in yield between vintage clusters for clone B.2. However, clone B.1 demonstrated distinct KMW and pH values. Both 'Kéknyelű’ clones have produced a substantially higher incidence of Botrytis infection in cluster 2 years than in cluster 3 years. Botrytis infection only showed statistically significant differences between year clusters for ‘Juhfark’. It is intriguing that in most years, the rotting rate was lower in both clones, especially in year clusters 1 and 3 when the overall rate of Botrytis infection was quite low. Our results highlighted the year-round sensitivity of the two varieties studied and the difficulties of clonal selection.

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.

In recent years, several industries have registered an impressive improvement in technological advances such as Internet of Things (IoT), e-commerce, vehicular networks, etc. These advances have sparked an increase in the volume of information that gets transmitted from different nodes of a computer network (CN). As a result, it is crucial to safeguard CNs against security threats and intrusions that can compromise the integrity of those systems. In this paper, we propose a machine mearning (ML) intrusion detection system (IDS) in conjunction with the Genetic Algorithm (GA) for feature selection. To assess the effectiveness of the proposed framework, we use the NSL-KDD dataset. Furthermore, we consider the following ML methods in the modelling process: decision tree (DT), support vector machine (SVM), random forest (RF), extra-trees (ET), extreme gradient boosting (XGB), and naïve Bayes (NB). The results demonstrated that using the GA algorithm has a positive impact on the performance of the selected classifiers. Moreover, the results obtained by the proposed ML methods were superior to existing methodologies.

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.

Nowadays, the selection of web services with uncertain quality of service (QoS) is gaining a lot of attention in the service-oriented computing paradigm (soc). In fact, searching for a service composition that fulfills a complex user’s request is known to be NP-Complete. The search time is mainly dependent on the number of the requested tasks, the size the available services, and the size of the QoS realizations (i.e., sample size). To handle this problem, we propose a two-stage approach that reduces the search space using heuristics for ranking the tasks’ services and a bat algorithm metaheuristic for selecting the final near optimal compositions. The fitness used by the metaheuristic aims to fulfill all the global constraints of the user. The experimental study shows that the ranking heuristics, termed “fuzzy pareto dominance” and "Zero-order stochastic dominance", are highly effective than the other heuristics and most of the existing state-of-the-art methods.

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.

Selecting a feature in data mining is one of the most challenging and important activities in pattern recognition. The issue of feature selection is to find the most important subset of the main features in a specific domain, the main purpose of which is to remove additional or unrelated features and ultimately improve the accuracy of the categorization algorithms. As a result, the issue of feature selection can be considered as an optimization problem and to solve it, meta-innovative algorithms can be used. In this paper, a new hybrid model with a combination of whale optimization algorithms and flower pollination algorithms is presented to address the problem of feature selection based on the concept of opposition-based learning. In the proposed method, we tried to solve the problem of optimization of feature selection by using natural processes of whale optimization and flower pollination algorithms, and on the other hand, we used opposition-based learning method to ensure the convergence speed and accuracy of the proposed algorithm. In fact, in the proposed method, the whale optimization algorithm uses the bait siege process, bubble attack method and bait search, creates solutions in its search space and tries to improve the solutions to the feature selection problem, and along with this algorithm, Flower pollination algorithm with two national and local search processes improves the solution of the problem selection feature in contrasting solutions with the whale optimization algorithm. In fact, we used both search space solutions and contrasting search space solutions, all possible solutions to the feature selection problem. To evaluate the performance of the proposed algorithm, experiments are performed in two stages. In the first phase, experiments were performed on 10 sets of data selection features from the UCI data repository. In the second step, we tried to test the performance of the proposed algorithm by detecting spam emails. The results obtained from the first step show that the proposed algorithm, by running on 10 UCI data sets, has been able to be more successful in terms of average selection size and classification accuracy than other basic meta-heuristic algorithms. Also, the results obtained from the second step show that the proposed algorithm has been able to perform spam emails more accurately than other similar algorithms in terms of accuracy by detecting spam emails.

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.

In photolithography process, nanometer level precise, wavefront aberration models enable the machine to be able to meet the overlay (OVL) drift and critical dimension (CD) specifications. Software control algorithms take as input these models and correct any expected wavefront imperfections before reaching the wafer. In such way a near optimal image is exposed on the wafer surface. Optimizing the parameters of these models though, involves several time costly sensor measurements which reduce the throughput performance, in terms of exposed wafers per hour, of the machine. In that case, photolithography machines come across the trade-off between throughput and quality. Therefore one of the most common Optimal Experimental Design (OED) problems in photolithography machines (and not only) is how to choose the minimum amount of sensor measurements that will provide the maximum amount of information. Additionally, each sensor measurement corresponds to a point on the wafer surface and therefore we must measure uniformly around the wafer surface as well. In order to solve this problem, we propose a Sensor Marks Selection Algorithm which exploits Genetic Algorithms. The proposed solution first selects a pool of points that qualify as candidates to be selected in order to meet the uniformity constraint. Then, the point that provides the maximum amount of information, quantified by the Fisher based criteria of G, D and A-Optimality, is selected and added to the measurement scheme. This process though is considered "greedy", and for this reason Genetic Algorithms (GA) are exploited to further improve the solution. By repeating in parallel the "greedy" part several times we get an initial population that will be the input to our GA. This meta-heuristic approach outperforms the "greedy" approach significantly. The proposed solution is applied in a real life semiconductors industry use case and achieves interesting industry and academical results as well.

Day-ahead forecasting of electricity prices is important in deregulated electricity markets for all the stakeholders: energy wholesalers, traders, retailers, and consumers. Electricity price forecasting is an inherently difficult problem due to its special characteristic of dynamicity and non-stationarity. In this paper, we present a robust price forecasting mechanism that shows resilience towards aggregate demand response effect and provides highly accurate forecasted electricity prices to the stakeholders in a dynamic environment. We employ an ensemble prediction model in which a group of different algorithms participate in predicting the price for each hour of a day. We propose two different strategies, namely, Fixed Weight Method (FWM) and Varying Weight Method (VWM), for selecting each hour's expert algorithm from the set of participating algorithms. In addition, we utilize a carefully engineered set of features selected from a pool of features derived from information such as past electricity price data, weather data, and calendar data. The proposed ensemble model offers better results than both the Pattern Sequence-based Forecasting (PSF) method and our own previous work using Artificial Neural Networks (ANN) alone do on the datasets for New York, Australian, and Spanish electricity markets.

This work addresses the challenge of EEG visual multiclass classification into 40 classes for Brain-Computer interface applications, by using deep learning architectures. The visual multiclass classification approach offers BCI applications a significant advantage, since it allows the supervision of more than one BCI interaction, considering that each class label supervises a BCI task. However, because of the nonlinearity and nonstationarity of EEG signals, performing multiclassifiers based on EEG features remains a significant challenge for BCI systems. In the present work, mutual information-based discriminant channel selection and Minimum-Norm Estimate algorithms are implemented to select discriminant channels and enhance EEG data. Hence, deep EEGNet and Convolutional-recurrent neural networks are implemented separately to classify EEG data of image visualization into 40 labels. By using the k-fold cross-validation approach, average classification accuracies of 94.8% and 89.8% were obtained by implementing the aforementioned network architectures, respectively. Satisfactory results obtained with this method offer a new implementation opportunity for multi-task BCI applications by utilizing a reduced number of channels (<50%), compared to those presented in the related literature where the whole set of channels is used.

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.

The relationship between the host and the microbiome, or the assemblage of microorganisms (including bacteria, archaea, fungi, and viruses), has been proven crucial for its health and disease development. The high dimensionality of microbiome datasets has often been addressed as a major difficulty for data analysis, such as the use of Machine Learning (ML) and Deep Learning (DL) models. Here we present BiGAMi, a bi-objective genetic algorithm fitness function for feature selection in microbial datasets to train high-performing phenotype classifiers. The proposed fitness function allowed us to build classifiers that outperformed the baseline performance estimated by the original studies by using as few as 0.04% to 2.32% features of the original dataset. In 19 out of 21 classification exercises, BiGAMi achieved its results by selecting 6-68% fewer features than the highest performance of a Sequential Forward Feature Selection algorithm. This study showed that the application of a bi-objective GA fitness function against microbiome datasets succeeded in selecting small subsets of bacteria whose contribution to understood diseases and the host state was already experimentally proven. Applying this feature selection approach to novel diseases is expected to quickly reveal the microbes most relevant to a specific condition.

Recently, the mapping industry has been focusing on the possibility of large-scale mapping from unmanned aerial vehicles (UAVs) owing to advantages such as easy operation and cost reduction. In order to produce large-scale maps from UAV images, it is important to obtain precise orientation parameters. For this, various techniques have been developed and are included in most of the commercial UAV image processing software. For mapping, it is equally important to select images that can cover a region of interest (ROI) with the fewest possible images. Otherwise, to map the ROI, one may have to handle too many images, and commercial software does not provide information needed to select images, nor does it explicitly explain how to select images for mapping. For these reasons, stereo mapping of UAV images in particular is time consuming and costly. In order to solve these problems, this study proposes a method to select images intelligently. We can select a minimum number of image pairs to cover the ROI with the fewest possible images. We can also select optimal image pairs to cover the ROI with the most accurate stereo pairs. We group images by strips, and generate the initial image pairs. We then apply an intelligent scheme to iteratively select optimal image pairs from the start to the end of an image strip. According to the results of the experiment, the number of images selected is greatly reduced by applying the proposed optimal image–composition algorithm. The selected image pairs produce a dense 3D point cloud over the ROI without any holes. For stereoscopic plotting, the selected image pairs were map the ROI successfully on a digital photogrammetric workstation (DPW), and a digital map covering the ROI is generated. The proposed method should contribute to time and cost reductions in UAV mapping.

: For a long time, atherosclerosis has been regarded as a mere lipid deposit in the blood vessels. However, in the recent years a growing body of experimental and clinical evidence have highlighted the role of inflammation and immunity as a central mechanism of disease. Moreover, in the last decade the coming of next-generation sequencing and its application to large human population has broken the barrier between inflammation and cancer. Indeed, acquired mutation in key genes related to the control of hematopoiesis and myeloproliferation have paved the way to establish the new concept of clonal hematopoiesis of indeterminate potential. This phenomenon is being considered not such “indeterminate”, but as an emerging cardiovascular risk factor. Thus, this may explain the mechanisms of myeloproliferation and inflammation in atherosclerosis. And in a bidirectional journey, it has helped to explain the extremely high cardiovascular risk in cancer survivors, in particular in myeloprolfierative neoplasm patients. A deeper understanding of these mechanisms may pave the way for the future early diagnosis and potential preemptive treatments of the leading worldwide cause of death.

Background: Alfalfa, the most economically important forage legume worldwide, features modest genetic progress due to long selection cycles and large extent of non-additive genetic variance associated with its autotetraploid genome. Methods: To improve the efficiency of genomic selection in alfalfa, we explored the effects of genome parametrization (as autotetraploid and diploid dosage, plus allele ratios) and SNP marker subsetting (all available SNPs; only genic regions; only non-genic regions) on genomic regressions, together with various levels of filtering on reading depth and missing rates. We used Genotyping by Sequencing-generated data and focused on traits of different genetic complexity, i.e., dry biomass yield in moisture-favorable (FE) and drought stress (SE) environments, leaf size, and onset of flowering, assessed on 143 genotyped plants from a genetically-broad European reference population and their phenotyped half-sib progenies. Results: On average, allele ratio improved the predictive ability compared with other genome parametrizations (+7.9% vs. tetraploid dosage, +12.6% vs. diploid dosage), SNP subsetting offered an advantage compared with any tested subsettings (+3.7% vs. genic regions, +7.6% vs. non-genic regions). However, when focusing on specific traits, different combinations of genome parametrization and subsetting reached better performances. We also released Legpipe2, a SNP calling pipeline tailored for reduced representation (GBS, RAD) medium-sized genotyping experiments.

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.

Mechanical circulatory support has proven effective in managing postcardiotomy cardiogenic shock by stabilizing patients' hemodynamics and ensuring adequate organ perfusion. Among the available device modalities, the combination of extracorporeal life support and a microaxial flow pump for left ventricular unloading has emerged as a valuable tool in the surgical arma-mentarium. In this publication, we provide recommendations for the application and weaning of temporary mechanical circulatory support in cardiogenic shock patients, derived from a con-sensus among leading cardiac centers in German-speaking countrie

Determining accurate PM2.5 pollution concentrations and understanding their dynamic patterns is crucial for scientifically informed air pollution control strategies. Traditional reliance on linear correlation coefficients for ascertaining PM2.5 related factors only uncovers superficial relationships. Moreover, the invariance of conventional prediction models restricts their accuracy. To enhance the precision of PM2.5 concentration prediction, this study introduces a novel integrated model that leverages feature selection and a clustering algorithm. Comprising three components - feature selection, clustering, and integrated prediction, the model first employs the non-dominated sorting Genetic Algorithm (NSGA-III) to identify the most impactful features affecting PM2.5 concentration within air pollutants and meteorological factors. This step offers more valuable feature data for subsequent modules. The model then adopts a two-layer clustering method (SOM+K-means) to analyze the multifaceted irregularity within the dataset. Finally, the model establishes the Extreme Learning Machine (ELM) weak learner for each classification, integrating multiple weak learners using the Adaboost algorithm to obtain a comprehensive prediction model. Through feature correlation enhancement, data irregularity exploration, and model adaptability improvement, the proposed model significantly enhances the overall prediction performance. Data sourced from 12 Beijing-based monitoring sites in 2016 were utilized for an empirical study, and the model's results compared with five other predictive models. The outcomes demonstrate that the proposed model significantly heightens prediction accuracy, offering useful insights and potential for broadened application to multifactor correlation concentration prediction methodologies for other pollutants.

In this work we looked for a stable and accurate procedure to perform feature selection in datasets with a much higher number of predictors than individuals, as in Genome-Wide Association Studies. Due to the instability in feature selection when many potential predictors are measured, a variable selection procedure is proposed that combines several replications of shrinkage regression models. A weighted formulation is used to define the final predictors. The procedure is applied to investigate Single Nucleotide Polymorphisms (SNPs) predictors associated to Alzheimer’s disease in the Alzheimer’s disease Neuroimaging Initiative (ADNI) dataset. Two data scenarios are investigated: one considering only the set of SNPs and another with the covariates age, sex, educational level and APOE4 genotype. The SNP rs2075650 and the APOE4 genotype are given as risk factors for AD, which is in line with the literature, and other four new SNPs are pointed, opening new hypotheses for in vivo analyses. These experiments demonstrate the potential of the new method for stable feature selection.

Recently concluded, large-scale cancer genomics studies involving multiregion sequencing of primary tumors and paired metastases appear to indicate that many or most cancer patients have one or more “clonal" mutations in their tumors. Clonal mutations are those that are present in all of a patient’s cancer cells. Achilles Therapeutics is currently the only company specifically targeting clonal mutations. However, they are doing so with tumor-derived T cells. To address the potential limitations of immunotherapy, I have devised another approach for exploiting clonal mutations, which I call “Oncolytic Vector Efficient Replication Contingent on Omnipresent Mutation Engagement” (OVERCOME). The ideal version of OVERCOME would likely employ a bioengineered facultative intracellular bacterium. The bacterium would initially be attenuated, but (transiently) reverse its attenuation upon clonal mutation detection.

Stagnation at local optima represents a significant challenge in bio–inspired optimization algorithms, often leading to suboptimal solutions. This paper addresses this issue by proposing a hybrid model that combines the Orca Predator Algorithm with Deep Q–Learning. Orca Predator Algorithm is an optimization technique that mimics the hunting behavior of orcas. It solves complex optimization problems by exploring and exploiting search spaces efficiently. Deep Q–Learning is a reinforcement learning technique that combines Q–Learning with deep neural networks. This integration aims to turn the stagnation problem into an opportunity for more focused and effective exploitation, enhancing the optimization technique’s performance and accuracy. The proposed hybrid model leverages the biomimetic strengths of Orca Predator Algorithm to identify promising regions nearby in the search space, complemented by the fine–tuning capabilities of Deep Q–Learning to navigate these areas precisely. The practical application of this approach is evaluated using the high–dimensional Heartbeat Categorization Dataset, focusing on the feature selection problem. This dataset, comprising complex electrocardiogram signals, provided a robust platform for testing the feature selection capabilities of our hybrid model. Our experimental results are encouraging, showcasing the hybrid strategy capability to identify relevant features without significantly compromising the performance metrics of machine learning models. This analysis was performed by comparing the improved method of Orca Predator Algorithm against its native version and a set of state–of–the–art algorithms.

In this study, we introduce and advanced multi-feature selection technique for bacterial classifi-cation employing the Salp Swarm Algorithm (SSA). We enhance SSA’s effectiveness by incorpo-rating the Opposition-Based Learning (OBL) strategy and the Local Search (LSA) algorithm. The proposed technique encompasses three key stages, streamlining the automated categorization of bacteria based on their distinctive features. The research adopts a multi-feature selection approach bolstered by an enhanced iteration of the Salp Swarm Algorithm (SSA). Enhancements include the utilization of Opposition-Based-Learning (OBL) to increase population diversity during search and Local Search Algorithms (LSA) to tackle local optimization challenges. The ISSA algorithm is designed to optimize the multi-feature selection by increasing the number of selected feature and improving classification accuracy. This study compares its performance with several other algo-rithms across ten distinct test datasets. The comparison results show that ISSA has better perfor-mance in terms of classification accuracy on 3 datasets consisting of 19 features, with a value reaching 73.75%. Additionally, ISSA excels in determining the optimal feature count and producing a better-fit value with a classification error rate of 0,249. Thus, the ISSA technique is expected to make a significant contribution to solving feature selection problems in bacterial analysis

A particular challenge in the conceptual design of direct-from orbit delivery systems is the seemingly well-known kinematics retain fallacies whose efficacies are reduced over great distances. Rotation about the local wing of an aerospace vehicle is almost never the pitch angle, yet modern application of kinematics often assumes such (with accompanying angular error). The same assertion is usually true about the nature of roll and yaw angles. Expressing motion in coordinates of rotating reference frames necessitates transformation between reference frames, and one such transformation is embodied in the Direction Cosine Matrices (DCM) formed by a sequence of three successive frame rotations. One of two ubiquitous sequences of three rotations used to construct the DCM involves first a rotation around the inertial z-axis, then intermediate y-axis, then finally about the body’s x-axis; a sequence commonly called the “aerospace sequence” or the a “3-2-1 rotation sequence”. The second ubiquitous sequence is the so-called “orbital sequence” or “3-1-3 rotation sequence” with rotations about the inertial z axis first, then about the intermediate x-axis, then finally about the body z-axis. This manuscript evaluates which sequence is the most advantageous for an object starting in space and then travels through the atmosphere to a target on the Earth’s surface. Six degrees of freedom of vehicle motion were simulated starting in orbit with a given thrust and commanded maneuver. The simulation performs all twelve possible rotation sequences (transforming inertial coordinates to body coordinates) with comparison by computational burden and error representing rotations about body axes (roll, pitch, and yaw respectively). Simulation precision is validated using the quaternion normalization condition indicating near machine precision (0.9\times{10}^{-15}) and reveals the so-called 132 rotation is the most accurate with an average error of 0.14° and a computational time of 0.013 seconds: resulting in a 97.95% increase in accuracy over the so-called 321 rotation and a 99.84% increase over the so-called 313 rotation.

Mental stress state recognition using electroencephalogram (EEG) signals for real-life applications needs a conventional wearable device. This requires an efficient number of EEG channels and an optimal feature set. The main objective of the study is to identify an optimal feature subset that can best discriminate mental stress states while enhancing the overall performance. Thus, multi-domain feature extraction methods were employed, namely, time domain, frequency domain, time-frequency domain, and network connectivity features, to form a large feature vector space. To avoid the computational complexity of high dimensional space, a hybrid feature selection (FS) method of minimum Redundancy Maximum Relevance with Particle Swarm Optimization and Support Vector Machine (mRMR-PSO-SVM) is proposed to remove noise, redundant, and irrelevant features and keep the optimal feature subset. The performance of the proposed method is evaluated and verified using four datasets, namely EDMSS, DEAP, SEED, and EDPMSC. To further consolidate, the effectiveness of the proposed method is compared with that of the state-of-the-art heuristic methods. The proposed model has significantly reduced the features vector space by an average of 70% in comparison to the state-of-the-art methods while significantly increasing overall detection performance.

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.

Brain metastases are highly evolved manifestations of breast cancer arising in a unique microenvironment, giving them exceptional adaptability in the face of new extrinsic pressures. The incidence is rising in line with population ageing, and use of newer therapies that stabilise metastatic disease burden with variable efficacy throughout the body. Historically, there has been a widely held view that brain metastases do not respond to circulating therapeutics because the blood-brain-barrier (BBB) restricts their uptake. However, emerging data are beginning to paint a far more complex picture where the brain acts as a sanctuary for dormant, subclinical proliferations that are initially protected by the BBB, but then exposed to dynamic selection pressures as tumours mature and vascular permeability increases. Here, we review key experimental approaches and landmark studies that have charted the genomic landscape of breast cancer brain metastases. These findings are contextualised with the factors impacting on clonal outgrowth in the brain: intrinsic breast tumour cell capabilities required for brain metastatic fitness, and the neural niche, which is initially hostile to invading cells but then engineered into a tumour-support vehicle by the successful minority. We also discuss how late detection, abnormal vascular perfusion and interstitial fluid dynamics underpin the recalcitrant clinical behaviour of brain metastases, and outline active clinical trials in the context of precision management.

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.

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.

Breast cancer is a significant health issue across the world. Breast cancer is the most widely-diagnosed cancer in women; early-stage diagnosis of disease and therapies increase patient safety. This paper proposes a synthetic model set of features focused on the optimization of the genetic algorithm (CHFS-BOGA) to forecast breast cancer. This hybrid feature selection approach combines the advantages of three filter feature selection approaches with an optimize Genetic Algorithm (OGA) to select the best features to improve the performance of the classification process and scalability. We propose OGA by improving the initial population generating and genetic operators using the results of filter approaches as some prior information with using the C4.5 decision tree classifier as a fitness function instead of probability and random selection. The authors collected available updated data from Wisconsin UCI machine learning with a total of 569 rows and 32 columns. The dataset evaluated using an explorer set of weka data mining open-source software for the analysis purpose. The results show that the proposed hybrid feature selection approach significantly outperforms the single filter approaches and principal component analysis (PCA) for optimum feature selection. These characteristics are good indicators for the return prediction. The highest accuracy achieved with the proposed system before (CHFS-BOGA) using the support vector machine (SVM) classifiers was 97.3%. The highest accuracy after (CHFS-BOGA-SVM) was 98.25% on split 70.0% train, remainder test, and 100% on the full training set. Moreover, the receiver operating characteristic (ROC) curve was equal to 1.0. The results showed that the proposed (CHFS-BOGA-SVM) system was able to accurately classify the type of breast tumor, whether malignant or benign.

Chromosomal instability (CIN), defined by variations in the number or structure of chromosomes from cell to cell, is recognized as a distinctive characteristic of cancer, associated with the ability of tumors to adapt to challenging environments. CIN has been recognized as a source of genetic variation that leads to clonal heterogeneity (CH). Recent findings suggest a potential association between CIN and CH with the prognosis of BC patients, particularly in tumors expressing the epidermal growth factor receptor 2 (HER2+). In fact, information on the role of CIN in other BC subtypes, including luminal B BC, is limited. Additionally, it remains unknown whether CIN in luminal B BC tumors, above a specific threshold, could have a detrimental effect on the growth of human tumors, or if low or intermediate CIN levels could be linked to a more favorable BC patient prognosis when contrasted with elevated levels. Clarifying these relationships could have a substantial impact on risk stratification and the development of future therapeutic strategies aimed at targeting CIN in BC. This study aimed to assess CIN and CH in tumor tissue samples from ten patients with luminal B BC, and compared them with established clinicopathological parameters. The results of our study show that luminal B BC patients exhibit intermediate CIN and stable aneuploidy, both of which correlated with lymphovascular invasion. These findings suggest that evaluating CIN, CH and aneuploidy could improve risk stratification, the prediction of clinical outcomes and future therapeutic approaches in luminal B BC patients.

In view of the problem of charging and hydrogen filling facilities construction in the transition from fuel vehicles to electric vehicles and hydrogen fuel cell vehicles, in order to meet the electric energy demand of electric vehicles and hydrogen energy demand of hydrogen fuel cell vehicles at the same time, this paper puts forward a method of siting and capacity determination of electric-hydrogen refueling integrated station (EHRIS) based on Voronoi diagram and particle swarm algorithm based on calculating the demand of charging and filling of hydrogen in vehicles. Firstly, OD pair(Origin-Destination) is used to represent the starting point and end point of the car to portray the travel demand of the car, and on the basis of the traffic network model, the shortest driving path of the new energy car is determined by Dijkstra algorithm, and Monte Carlo simulation is used to get the electric-hydrogen energy demand of the car; secondly, the Voronoi diagram is introduced to classify the service scope of the electric-hydrogen charging station to determine the equipment capacity of the electric-hydrogen charging station, while taking into account the electric-hydrogen charging and refueling capacity. Secondly, a Voronoi diagram is introduced to divide the service scope of the EHRIS, determine the capacity of the equipment in the EHRIS, and consider the distance constraints between the sites of EHRIS, so as to make the division of the site and service scope more reasonable. Finally, a dynamic optimal current model framework for distribution networks based on second-order cone relaxation is established, and each element of the active distribution network is planned, so that the distribution network can operate safely and stably after being connected to the EHRIS. With the objective of minimizing the total social cost of EHRIS and considering the constraints of the charging equipment and hydrogen production and injection equipment of the EHRIS, a siting and capacity model to meet the electric-hydrogen energy demand of electric and hydrogen fuel cell vehicles is developed, and solved by a particle swarm algorithm. Finally, the simulation planning is carried out with Sioux Falls city and IEEE33 network, which ensures the stable operation of the power grid while meeting the energy demand of automobiles, and the results verify the effectiveness and feasibility of the proposed method.

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.

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.

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.

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.

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.

Due to the rapid development of unmanned aerial vehicles (UAVs) communication technology, UAVs are gradually competing with primary users (PUs) for spectrum resources. Cognitive radio (CR) is a promising solution to meet the needs. Cooperative spectrum sensing (CSS) is considered as an effective method to detect the PU signal and identify available spectrum resources for UAVs in a cognitive UAV network (CUAVN). However, the cooperative mode among multiple UAVs may incur a high overhead, resulting in performance degradation. Therefore, we introduce a differential sequential 1 (DS1), which incorporates a differential mechanism and leverages the sequential idea based on the classical voting rule to enhance cooperative performance and efficiency. In view of this, we formulate three scenarios to characterize the PU activity and introduce a multi-slot cooperative mode within a single UAV to realize cooperative gain. Further, only the information change about the PU status is sequentially calculated in DS1, and combined with a sequential idea, the efficiency of the voting rule is greatly improved. Moreover, the application of support vector machines (SVM) in dynamic selection enables the selection of the most suitable voting rule based on diverse sensing parameters. This dynamic selection process ensures optimal performance and efficiency by adapting the voting rule to the specific characteristics of the given scenario. Finally, simulation results demonstrate that the superiority of our proposal with respect to the detection performance, sample size and the energy efficiency is evident, which proves the high performance of the proposed policy.

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

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.

The Giant Babax, an endemic bird in China and a nationally protected wildlife species of Class Ⅱ, is primarily distributed in southern and southeastern Tibet. To investigate the factors influencing nesting site selection, this study conducted research on nest characteristics and nesting site preferences at four sample sites around Lhasa from March to October 2023y, using systematic search methods, tracking methods, and sampling methods. The research findings are as follows: (1) The average nest depth was (7.70±1.47)cm, nest height was (19.58±2.97)cm, inner diameter was (10.64±1.73)cm, outer diameter was (24.65±4.8)cm, average weight was (162.3±13.5)g, and average nest spacing within the plot was 396.93m. (2) The nests of Giant Babax were predominantly found on vegetation such as Salix longistamina (38%), Hippophae gyantsensis (20%), Rosa sericea Lindl. (14%), and Populus szechuanica Schneid(11%). They showed a preference for artificial secondary forests as nesting sites. (3) Giant Babax exhibited a preference for habitats with robust trees that had high canopies while being distant from houses and roads, but close to water sources; moreover, the canopy of the nesting tree played a crucial role in their choice of nesting sites. (4) The reproductive success rate reached 76%, with key factors affecting it being the canopy coverage of the nesting tree and the number of helpers. These research results provide fundamental data support for population conservation efforts and ecological resource management strategies concerning the Giant Babax.

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.

Object recognition is an essential element of machine intelligence tasks. However, one model cannot practically be trained to identify all the possible objects it encounters. An ensemble of models may be needed to cater to a broader range of objects. Building a mathematical understanding of the relationship between various objects that share comparable outlined features is envisaged as an effective method of improving the model ensemble through a pre-processing stage, where these objects' features are grouped under a broader classification umbrella. This paper proposes a mechanism to train an ensemble of recognition models coupled with a model selection scheme to scale-up object recognition in a multi-model system. An algorithmic relationship between the learnt parameters of a trained classification model and the features of input images is presented in the paper for the system to learn the model selection scheme. The multiple models are built with a CNN structure, whereas the image features are extracted using a CNN/VGG16 architecture. Based on the models' excitation weights, a neural network model selection algorithm, which links a new object with the models and decides how close the features of the object are to the trained models for selecting a particular model for object recognition is developed and tested on a five-model neural network platform. The experiment results show the proposed model selection scheme is highly effective and accurate in selecting an appropriate model for a network of multiple models.

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.

The COVID-19 pandemic over the past years has shown a great need for rapid, low-cost and on-site detection of severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2). In this paper, an aptamer-based colloidal gold nanoparticle lateral flow test strip was well developed to realize the visual detection of wild type SARS-CoV-2 spike protein (SP) and multiple variants. Under the optimal reaction conditions, a low detection limit of SARS-CoV-2 S protein of 0.68 nM was acquired, and the actual detection recovery was 83.3% to 108.8% for real world samples. This suggests a potential tool for the prompt detection of SARS-CoV-2 with good sensitivity and accuracy, and a new method for the development of alternative antibody test strips for the detection of other viral targets.

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.

Surface water distribution extracted from remote sensing data has been used in water resource assessment, coastal management, and environmental change studies. Traditional manual methods for extracting water bodies cannot satisfy the requirements for mass processing of remote sensing data; therefore, accurate automated extraction of such water bodies has remained a challenge. The histogram bimodal method (HBM) is a frequently used objective tool for threshold selection in image segmentation. The threshold is determined by seeking twin peaks, and the valley values between them; however, automatically calculating the threshold is difficult because complex surfaces and image noise which lead to not perfect twin peaks (single or multiple peaks). We developed an operational automated water extraction method, the modified histogram bimodal method (MHBM). The MHBM defines the threshold range of water extraction through mass static data; therefore, it does not require the identification of twin histogram peaks. It then seeks the minimum values in the threshold range to achieve automated threshold. We calibrated the MHBM for many lakes in China using Landsat 8 Operational Land Imager (OLI) images, for which the relative error (RE) and squared correlation coefficient (R2) for threshold accuracy were found to be 2.1% and 0.96, respectively. The RE and root-mean-square error (RMSE) for the area accuracy of MHBM were 0.59% and 7.4 km2. The results show that the MHBM could easily be applied to mass time-series remote sensing data to calculate water thresholds within water index images and successfully extract the spatial distribution of large water bodies automatically.

A multimodal detection system with complementary capabilities for efficient detection was developed for impurity detection. The system consisted of a visible light camera, a multispectral camera, image correction and registration algorithms. It can obtain spectral feature and color feature at the same time, and has higher spatial resolution than a single spectral camera. This system was applied to detect impurities in Pu ’er tea to verify its high efficiency. The spectral and color features of each pixel in the images of Pu ’er tea were obtained by this system and used for pixel classification. The experimental results show that the accuracy of Support Vector Machine (SVM) model based on combined features is 93%, which is 7% higher than that based on only spectral features. By applying median filtering algorithm and contour detection algorithm to the label matrix extracted from pixel-classified images, 8 impurities except hair were detected successfully. Moreover, taking advantage of the high resolution of visible light camera, small impurities can be clearly imaged. By comparing the segmented color image with the pixel-classified image, small impurities such as hair could be detected successfully. Finally, it is proved that the system can obtain multiple images to allow a more detailed and comprehensive understanding of the detected items, and has excellent ability to detect small impurities.

The last-mile logistics in cities have become an indispensable part of the urban logistics system. This study aims to explore the effective selection of last-mile logistics nodes to enhance the efficiency of logistics distribution, strengthen the corporate distribution image, and further reduce corporate operating costs and alleviate urban traffic congestion. This paper proposes a clustering-based approach to identify urban logistics nodes from the perspective of geographic information fusion. This method comprehensively considers several key indicators, including the coverage, balance, and urban traffic conditions of logistics distribution. Additionally, we employed a greedy algorithm to identify secondary nodes around primary nodes, thus constructing an effective nodal network. To verify the practicality of this model, we conducted an empirical simulation study using the logistics demand and traffic conditions in the Xianlin District of Nanjing. This research not only identified the locations of primary and secondary logistics nodes but also provided a new perspective for constructing the urban last-mile logistics system, enriching the academic research related to logistics node construction. The results of this study are of significant theoretical and practical importance for optimizing urban logistics networks, enhancing logistics efficiency, and promoting the improvement of urban traffic conditions.

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.

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.

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.

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.

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.

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.

In a hyperconnected society, computer networks play a pivotal role in all activities that permeate our daily lives. In the context of smart cities, theses networks play a pivotal role in enhancing urban efficiency and sustainability. The continuous flow of packets in these networks poses security challenges, from personal data leakage to service unavailability. Anomaly-based methods are commonly used to detect network attacks. In this context, Software-Defined Networking (SDN) emerges as a solution for anomaly detection in network traffic, facilitating comprehensive, real-time analyses and dynamic adaptation to changes. This study aims to present a systematic review of feature selection techniques and evaluate the effectiveness of attribute selection with a multi-class classifier in network anomaly detection. The objective of this paper is to inspire future research and identify trade-offs among these techniques for detecting Denial of Service (DoS) attacks. Based on the findings, the analysis of the entire dataset yields superior results in terms of precision (99%), but using the output of OneR, although resulting in a slight loss of precision compared to the complete dataset, presents the highest precision among other studied techniques, indicating a trade-off between precision and processing time efficiency.

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.

Model selection and model averaging have been the popular approaches in handling modelling uncertainties. Fan and Li(2006) laid out a unified frame work for variable selection via penalized likelihood. The tuning parameter selection is vital in the optimization problem for the penalized estimators in achieving consistent selection and optimal estimation. Since the OLSpost-LASSO estimator by Belloni and Chernozhukov (2013), few studies have focused on the finite sample performances of the class of OLS post-penalty estimators with the tuning parameter choice determined by different tuning parameter selection approaches. We aim to supplement the existing model selection literature by studying such a class of OLS post-selection estimators. Inspired by the Shrinkage Averaging Estimator (SAE) by Schomaker(2012) and the Mallows Model Averaging (MMA) criterion by Hansen (2007), we further propose a Shrinkage Mallows Model Averaging (SMMA) estimator for averaging high dimensional sparse models. Based on the Monte Carlo design by Wang et al. (2009) which features an expanding sparse parameter space as the sample size increases, our Monte Carlo design further considers the effect of the effective sample size and the degree of model sparsity on the finite sample performances of model selection and model averaging estimators. From our data examples, we find that the OLS post-SCAD(BIC) estimator in finite sample outperforms most of the current penalized least squares estimators as long as the number of parameters does not exceed the sample size. In addition, the SMMA performs better given sparser models. This supports the use of the SMMA estimator when averaging high dimensional sparse models.

Hybrid forecasting methods have emerged as a solution surpassing the limitations of both statistical and deep learning approaches. While the first emphasize the significance of variables, they often produce worse forecasting results when compared to newer techniques. In contrast, deep learning models remain enigmatic "black boxes" in terms of interpretability, although achieving better results in forecasting. This article introduces the Comprehensive Cross-Correlation and Lagged Linear Regression Deep Learning (CCLR-DL) framework, designed to harness the best of both approaches, enhancing forecasting accuracy while retaining model interpretability through a feature selection process. CCLR-DL blens cross-correlation analysis, lagged multiple linear regression and granger's causality procedures with deep learning architectures based on LSTM. In a practical demonstration, CCLR-DL was applied to a real database of clinical visits associated to diagnoses in Catalonia, Spain (tracking a population of 6.3 million patients during 10 years). Predicting visits enables the healthcare managers to be ready for future demand shifts. Results demonstrate a consistent and substantial improvement over standalone statistical and deep learning methods when predicting healthcare demand. This hybrid approach not only showcases its efficacy but also offers a promising solution to the challenge of balancing predictive accuracy with model explicability. In this context, this work aims to design and validate a method for feature selection and forecasting of multivariate high dimensional time series datasets not only to improve prediction accuracy but also to model transparency by identifying a subset of variables that improve predictions and G-cause the target variable.

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.

Patients receiving hemodialysis are at risk of vascular access infections (VAIs) and particularly vulnerable to the opportunistic pathogen Staphylococcus aureus. Hemodialysis patients were also at increased risk of infection during the COVID-19 pandemic. Therefore, this study determined the change in the molecular and antibiotic resistance profiles of S. aureus isolates from VAIs during the pandemic compared with before. 102 S. aureus isolates were collected from VAIs between November 2013 and December 2021. Before the pandemic, 69 isolates were collected, 58%, 39.1%, and 2.9% from arteriovenous grafts (AVGs), tunneled cuffed catheters (TCCs), and arteriovenous fistulas (AVFs), respectively. The prevalence of AVG and TCC isolates changed to 39.4% and 60.6%, respectively, of 33 isolates during the pandemic. Sequence type (ST)59 was the predominant clone in TCC-methicillin-resistant S. aureus (MRSA) and AVG-MRSA before the pandemic, whereas the predominant clone was ST8 in AVG-MRSA during the pandemic. ST59 carrying the ermB gene was resistant to clindamycin and erythromycin. By contrast, ST8 carrying the msrA gene was exclusively resistant to erythromycin. The ST distribution for different VAIs changed from before to during the pandemic. The change in antibiotic resistance rate for different VAIs was closely related to the distribution of specific STs.

Anticancer regimens for Hodgkin lymphoma (HL) patients include highly genotoxic drugs that have been very successful in killing tumor cells and providing a 90% disease-free survival at five years. However, these treatments do not have a specific cell target, damaging both cancerous and normal cells. Thus, HL survivors have a high risk of developing new primary cancers, both hematologic and solid tumors, that have been related to treatment. Several studies have shown that after-treatment, HL patients and survivors present persistent chromosomal instability, including non-clonal chromosomal aberrations. The frequency and type of chromosomal abnormalities appear to depend on the type of therapy and the cell type examined. For example, MOPP chemotherapy affects hematopoietic and germ stem cells leading to long-term genotoxic effects and azoospermia, while ABVD chemotherapy affects transiently sperm cells, with most of the patients showing recovery of spermatogenesis. Both regimens have long-term effects in somatic cells, presenting non-clonal chromosomal aberrations and genomic chaos in a fraction of non-cancerous cells. This is a source of karyotypic heterogeneity that could eventually generate a more stable population acquiring clonal chromosomal aberrations and leading towards the development of a new cancer.

The paper presents attribute based characterization of nanomaterials method for computer storage and retrieval as knowledgebase. The knowledgebase permits indepth understanding and comparison between nanomaterials available with the scientists and product developers to satisfy their research and development (R & D) needs. Techniques for order preference by similarity to ideal solution (TOPSIS) is proposed to evaluate nanomaterials in the presence of multiple attributes. The method normalizes attributes to nullify the effect of different units and their values in the range of 0 to 1. The relative importance of different attributes for different applications is considered. The weight vector is derived using Eigen value formulation. The positive and negative benchmark solutions are derived. Euclidean distance of alternatives from these best and worst solution leads to the development of proximity /goodness/suitability index for ranking. Final decision is taken by decision makers by SWOT analysis and short and long term strategies of the organisation. The methodology is illustrated with the help of an example and step-by-step procedure. Results, discussion and conclusion highlights the importance and practical application.

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.

There is scientific consensus that organismal aging did not evolve by natural selection (NS) because it lacks individual benefit. Nonetheless it exists, leading to much speculation about its origins, and when the diminishing force of selection begins. Both concepts are based upon two misconceptions; that aging occurs in and of itself and is caused by the declining strength of NS during the reproductive lifespan. Although lacking individual benefit, aging evolved by NS as a tradeoff of survival for reproduction. Based upon regulatory dynamics that participate in this tradeoff, aging begins once reproductive success has been achieved through offspring nurturing. Thereafter, the strength of NS wanes to exponentially accelerate aging, leading to death. Assumptions of the theory are that: (1) a life-long, “holistic” regulatory mechanism whose genic expression is modified epigenetically, originates in ontogenesis; (2) the regulatory mechanism of the last developmental stage becomes redundantly expressed during “morphostasis”, a non-aging, life interval of peak vitality to ensure completion of reproduction through nurturing, and (3) thereafter, loss of regulatory redundancy causes aging which reduces the strength of natural selection and allows accumulation of randomly occurring somatic damage.

ESBL-producing E. coli is a growing public problem in healthcare settings and the community. Between 2009 and 2018, a total of 187 ESBL-producing pathogenic E. coli isolates were confirmed, and clonal complex (CC) 10 was the predominant clone. This study aimed to characterize ESBL-producing pathogenic E. coli CC10 strains obtained from diarrheal patients to improve the understanding of CC10 distribution in the Republic of Korea. A total of 57 CC10 strains were selected for molecular characterizations, such as the identification of serotype, antibiotic resistance genes, genetic environments, plasmid profiles, and the genetic correlation between CC10 strains. In the CC10 isolates, the most prevalent serotype was O25:H16, followed by O6:H16. ESBL genes were identified as blaCTX-M, and the most dominant ESBL gene was blaCTX-M-15 (56%) and blaCTX-M-14 (30%). Most blaCTX-M genes were located on plasmids, and these plasmid profiles were confirmed as IncB/O/K/Z, IncF, IncI1 and IncX1. The mobile elements located up-and down-stream mainly included ISEcp1 (complete or incomplete) and IS903 or orf477 were found, respectively. Phylogenetic analysis showed that the CC10 strains were genetically diverse and divided into several distinct lineages. In this study, we found that CC10 ESBL-producing pathogenic E. coli has been steadily isolated; particularly, CTX-M-15-producing E. coli O25:H16 isolates were the major type related with distribution in CC10 clones during the last decade. Identification of ESBL-producing pathogenic E. coli CC10 isolates highlights the possibility of the emergence of resistant isolates with epidemic potential within this CC. Therefore, continuous monitoring will be conducted to prevent further spread of resistant ESBL-producing E. coli CC10 strains.

More and more works are using machine learning techniques while adopting supervisory control and data acquisition (SCADA) system for wind turbine anomaly or failure detection. While parameter selection is important for modelling a wind turbine’s health condition, only a few papers have been published focusing on this issue and in those papers interconnections among sub-components in a wind turbine are used to address this problem. However, merely the interconnections for decision making sometimes is too general to provide a parameter list considering the differences of each SCADA dataset. In this paper, a method is proposed to provide more detailed suggestions on parameter selection based on mutual information. Moreover, after proving that Copula, a multivariate probability distribution for which the marginal probability distribution of each variable is uniform is capable of simplifying the estimation of mutual information, an empirical copula based mutual information estimation method (ECMI) is introduced for an application. After that, a real SCADA dataset is adopted to test the method, and the results show the effectiveness of the ECMI in providing parameter selection suggestions when physical knowledge is not accurate enough.

Background: The genetic variants identified by three large genome-wide association studies (GWAS) of educational attainment were used to test a polygenic selection model. Methods: Average frequencies of alleles with positive effect (polygenic scores or PS) were compared across populations (N=26) using data from 1000 Genomes. A null model was created using frequencies of random SNPs. Results: Polygenic selection signal of educational attainment GWAS hits is high among a handful of SNPs within genomic regions replicated across GWAS publications. A polygenic score comprising 9 SNPs predicts population IQ (r=0.88), outperforming 99% of the polygenic scores obtained from sets of random SNPs (Monte Carlo p= 0.011). Its predictive power remains unaffected after controlling for spatial autocorrelation (Beta= 0.83). The largest polygenic score (161 SNPs) exhibits similar predictive power (Beta=0.8). Random polygenic scores are moderate predictors of population IQ (thanks to spatial autocorrelation), and their predictive power increases logarithmically with the number of SNPs, indicating an exponential reduction in noise. Conclusion: This study provides guidance for using GWAS hits together with random SNPs for testing polygenic selection using Monte Carlo simulations.

This article introduces an innovative design method for public lighting systems that surpasses the limitations of conventional approaches, which rely on predefined lamp characteristics and spatial arrangement. By employing a multi-criteria decision algorithm, our study proposes an optimal design methodology considering several key aspects, including the distance between lamps, their type, power, and light distribution. The goal is to achieve optimal illumination that enhances visibility on public roads for drivers and pedestrians while simultaneously minimizing glare, installation costs and maximizing energy efficiency. The proposed methodology is implemented through an algorithm developed in Matlab, with results validated through simulations in Dialux. This information is used to construct a decision matrix, assessed using the CRITIC method across 180 different scenarios within a specific case study. The findings demonstrate the effectiveness of multi-criteria decision-making as a tool for significantly improving the planning and design of lighting in public illumination systems, allowing for selecting the optimal combination of parameters that ensure the best lighting conditions.

Evolutionary ecology may be described as explaining ecology through evolution and vice versa, but one may also view it as an integration of the two fields, where one takes the view that ecology and evolution are inseparable, and one can only begin to understand the biology of organisms by synthesizing the two fields. An example of such a synthesis is the biology of high fecundity and the associated concept of sweepstakes reproduction, or skewed individual recruitment success. As an illustration we consider selection at linked sites under various dominance and epistasis mechanisms in a diploid population evolving according to random sweepstakes and experiencing recurrent bottlenecks. Using simulations we give a few examples of the impact of the stated elements on selection. We show that depending on the dominance mechanisms random sweepstakes can shorten the time to fixation (conditional on fixation) of the fit type at all sites. Bottlenecks tend to increase the fixation time, with random sweepstakes counteracting the effects of bottlenecks on the fixation time. Understanding the effect of random sweepstakes, recurrent bottlenecks, dominance mechanisms and epistasis on the fate of selectively advantageous mutations may help with explaining genetic diversity in natural highly fecund populations possibly evolving under sweepstakes reproduction.

The advancement of sequencing technology and molecular breeding methods have provided technical support and assurance for accurate breeding. Genomic Selection (GS) utilizes genomic information to improve livestock breeding and, it is more accurate and more efficient than traditional selection methods. GS has been widely applied in domestic animals breeding, especially in cattle. However, there is still limited study on the application and research of GS in sheep and goat. In this paper, we outlined the principle, analysis methods, the influential factors of GS, and elaborated on the research progress, challenges, and prospects of applying GS in sheep and goat breeding. Through the review of these aspects this paper is expected to provide valuable references for the implementation of GS in the field of sheep and goat breeding.

The thermocontextual interpretation (TCI) establishes a system’s exergy, entropic energy, and thermal entropy as thermocontextual properties of state, defined with respect to its positive temperature surroundings. This work extends previous applications of the TCI to irreversible and statistical transitions. The TCI defines statistical entropy as a transactional process of derandomization and transition to a negative-entropy state. Statistical measurements of a confined quantum particle’s position are detailed in terms of reversible processes of instantiation and actualization. The TCI then formalizes the MaxEnt as a fundamental physical principle. We apply MaxEnt and statistical entropy measurements to the double-slit experiment. Particles passing through parallel slits record a wave interference pattern, but a “which-slit” detector eliminates wave interference. Richard Feynman called the double-slit experiment the only mystery, at the heart of quantum mechanics. The TCI offers a simple explanation. The which-slit detector breaks the system’s symmetry, enabling particles to pass through one slit or the other, and MaxEnt selects the asymmetrical transition, which has no wave interference and a higher statistical entropy.

Wheat (Triticum aestivum L.) breeding programs can take over a decade to release a new variety. However, new methods of selection such as genomic selection (GS) must be integrated to decrease the time it takes to release new varieties to meet the demand of a growing population. The implementation of GS into breeding programs is still being explored, with many studies showing its potential to change wheat breeding through achieving higher genetic gain. In this review, we explore the integration of GS for a wheat breeding program by redesigning the traditional breeding pipeline to implement GS. We propose implementing a two-part breeding strategy by differentiating between population improvement and product development. The implementation of GS in the product development pipeline can be integrated into most stages and can predict within and across breeding cycles. Additionally, we explore optimizing the population improvement strategy through GS recurrent selection schemes to reduce crossing cycle time and significantly increase genetic gain. The recurrent selection schemes can be optimized for parental selection, maintenance of genetic variation, and optimal cross-prediction. Overall, we outline the ability to increase the genetic gain of a breeding program by implementing GS and a two-part breeding strategy.

Nowadays genetic algorithm (GA) is greatly used in engineering pedagogy as an adaptive technique to learn and solve complex problems and issues. It is a meta-heuristic approach that is used to solve hybrid computation challenges. GA utilizes selection, crossover, and mutation operators to effectively manage the searching system strategy. This algorithm is derived from natural selection and genetics concepts. GA is an intelligent use of random search supported with historical data to contribute the search in an area of the improved outcome within a coverage framework. Such algorithms are widely used for maintaining high-quality reactions to optimize issues and problems investigation. These techniques are recognized to be somewhat of a statistical investigation process to search for a suitable solution or prevent an accurate strategy for challenges in optimization or searches. These techniques have been produced from natural selection or genetics principles. For random testing, historical information is provided with intelligent enslavement to continue moving the search out from the area of improved features for processing of the outcomes. It is a category of heuristics of evolutionary history using behavioral science-influenced methods like an annuity, gene, preference, or combination (sometimes refers to as hybridization). This method seemed to be a valuable tool to find solutions for problems optimization. In this paper, the author has explored the GAs, its role in engineering pedagogies, and the emerging areas where it is using, and its implementation.

Escherichia coli is the main pathogen responsible for extraintestinal infections. A total of 196 clinical E. coli consecutively isolated during 2016 in Spain (100 from Lucus Augusti hospital in Lugo) and France (96 from Beaujon hospital in Clichy) were characterized. Phylogroups, clonotypes, sequence types (STs), O:H serotypes, virulence factor (VF)-encoding genes and antibiotic resistance were determined. Approximately 10% of the infections were caused by ST131 isolates in both hospitals and approximately 60% of these infections were caused by isolates belonging to only 10 STs (ST10, ST12, ST58, ST69, ST73, ST88, ST95, ST127, ST131, ST141). ST88 isolates were frequent especially in Spain while ST141 isolates significantly predominated in France. The 23 ST131 isolates displayed four clonotypes: CH40-30, CH40-41, CH40-22 and CH40-298. Only 13 (6.6%) isolates were carriers of ESBL enzymes. However, 37.2% of the isolates were multidrug-resistant (MDR). Approximately 40% of the MDR isolates belonged to only four of the dominant clones (B2-CH40-30-ST131, B2-CH40-41-ST131, C-CH4-39-ST88 and D-CH35-27-ST69). Among the remaining MDR isolates two isolates belonged to B2-CH14-64-ST1193 i.e the new global emergent MDR clone. To our knowledge, it is the first identification of this emergent clone in Spain. Moreover, a hybrid ExPEC/enteroaggregative isolate belonging to A-CH11-54-ST10 clone was identified.

In recent times, voice assistants have become a part of our day-to-day lives, allowing information retrieval by voice synthesis, voice recognition, and natural language processing. These voice assistants can be found in many modern-day devices such as Apple, Amazon, Google, and Samsung. This project is primarily focused on Virtual Assistance in Natural Language Processing. Natural Language Processing is a form of AI that helps machines understand people and create feedback loops. This project will use deep learning to create a Voice Recognizer and use Commonvoice and data collected from the local community for model training using Google Colaboratory. After recognizing a command, the AI assistant will be able to perform the most suitable actions and then give a response. The motivation for this project comes from the race and gender bias that exists in many virtual assistants. The computer industry is primarily dominated by the male gender, and because of this, many of the products produced do not regard women. This bias has an impact on natural language processing. This project will be utilizing various open-source projects to implement machine learning algorithms and train the assistant algorithm to recognize different types of voices, accents, and dialects. Through this project, the goal to use voice data from underrepresented groups to build a voice assistant that can recognize voices regardless of gender, race, or accent. Increasing the representation of women in the computer industry is important for the future of the industry. By representing women in the initial study of voice assistants, it can be shown that females play a vital role in the development of this technology. In line with related work, this project will use first-hand data from the college population and middle-aged adults to train voice assistants to combat gender bias.

Chickens have extensive phenotypic variation. The Wuhua yellow chicken (WHYC) is an important traditional yellow-feathered chicken in China, characterized by white tail feathers, white flight feathers, and strong disease resistance. However, the genomic basis of traits associated with WHYC is still poorly understood. In this study, whole genome resequencing was performed with an average coverage of 20.77-fold to investigate heritable variation and identify selection signals in WHYC. Reads were mapped onto the chicken reference genome (Galgal5) with a coverage of 85.95%. After quality control, 11,953,471 SNPs and 1,069,574 InDels were obtained. In addition, 41,408 structural variants and 33,278 copy number variants were found. A comparative genomic analysis of WHYC and other yellow-feathered chicken showed that selected regions were enriched in genes involved in transport and catabolism, immune system, infectious diseases, signal transduction, and signaling molecules and interaction. Several genes associated with disease resistance were identified, including IFNA, IFNB, CD86, IL18, IL11RA, VEGFC, and ATG10. Furthermore, PMEL and TYRP1 may contribute to the coloring of white feathers in WHYC. These findings improve our understanding of the genetic characteristics of WHYC and may contribute to future breed improvement.

Biologists seek to identify a small number of significant features that are important, non-redundant, and relevant from diverse omics data. For example, statistical methods like LIMMA and DEseq distinguish differentially expressed genes between a case and control group from the transcript profile. Researchers also apply various column subset selection algorithms on genomics datasets for a similar purpose. Unfortunately, genes selected by such statistical or machine learning methods are often highly co-regulated, making their performance inconsistent. Here, we introduce a novel feature selection algorithm that selects highly disease-related and non-redundant features from a diverse set of omics datasets. We successfully applied this algorithm to three different biological problems: a) disease to normal sample classification, b) multiclass classification of different disease samples, and c) disease subtypes detection. Considering classification ROC-AUC, False-positive, and False-negative rates, our algorithm outperformed other gene selection and differential expression (DE) methods for all six types of cancer datasets from TCGA considered here for binary and multiclass classification problems. Moreover, genes picked by our algorithm improved the disease subtyping accuracy for four different cancer types over the state-of-the-art methods. Hence, we posit that our proposed feature reduction method can support the community to solve various problems, including the selection of disease-specific biomarkers, precision medicine design, and disease sub-type detection.

Developing effective trend estimators is a main method to solve the online portfolio selection problem. Although the existing portfolio strategies have demonstrated good performance through the development of various trend estimators, it is still challenging to determine in advance which estimator will yield the maximum final cumulative wealth in online portfolio selection tasks. This paper studies an online ensemble approach for online portfolio selection by leveraging the strengths of multiple trend estimators. Specifically, a return-based loss function and a cross-entropy-based loss function are first designed to evaluate the adaptiveness of different trend estimators in a financial environment. On this basis, a passive aggressive ensemble model is proposed to weigh these trend estimators within a unit simplex according to their adaptiveness. Extensive experiments are conducted on benchmark datasets from various real-world stock markets to evaluate the performance. The results show that the proposed strategy achieves the state-of-the-art performance including efficiency and cumulative return.

Plant geneticists and breeders have used marker technology since the 1980s in quantitative trait locus (QTL) identification. Marker-assisted selection is effective for large-effect QTL but has been challenging to use with quantitative traits controlled by multiple minor effect alleles. Therefore, genomic selection (GS) was proposed to estimate all markers simultaneously, thereby capturing all their effects. However, breeding programs are still struggling to identify the best strategy to implement it into their programs. Traditional breeding programs need to be optimized to implement GS effectively. This review explores the optimization of breeding programs for variety release based on aspects of the breeder’s equation. Optimizations include reorganizing field designs, training populations, increasing the number of lines evaluated, and leveraging the large amount of genomic and phenotypic data collected across different growing seasons and environments to increase heritability estimates, selection intensity, and selection accuracy. Breeding programs can leverage their phenotypic and genotypic data to maximize genetic gain and selection accuracy through GS methods utilizing multi-trait and, multi-environment models, high-throughput phenotyping, and deep learning approaches. Overall, this review describes various methods that plant breeders can utilize to increase genetic gains and effectively implement GS in breeding .

Natural selection is commonly seen not just as an explanation for adaptive evolution, but as the inevitable consequence of “heritable variation in fitness among individuals”. Although it remains embedded in biological concepts, such a formalisation makes it tempting to explore whether this precondition may be met not only in life as we know it, but also in other physical systems. This would imply that these systems are subject to natural selection and may perhaps be investigated in a biological framework, where properties are typically examined in light of their putative functions. Here we relate the major questions that were debated during a three-day workshop[1] devoted to discussing whether natural selection may take place in non-living physical systems. We start this report with a brief overview of research fields dealing with “life-like” or “proto-biotic” systems, where mimicking evolution by natural selection in test tubes stands as a major objective. We contend the challenge may be as much conceptual as technical. Taking the problem from a physical angle, we then discuss the framework of dissipative structures. Although life is viewed in this context as a particular case within a larger ensemble of physical phenomena, this approach does not provide general principles from which natural selection could be derived. Turning back to evolutionary biology, we ask to what extent the most general formulations of the necessary conditions or signatures of natural selection may be applicable beyond biology. In our view, such a cross-disciplinary jump is in large part impeded by reliance on individuality as a central yet implicit and loosely defined concept. Overall, these discussions thus lead us to conjecture that understanding, in physico-chemical terms, how individuality emerges and how it can be recognised, will be essential in the search for instances of evolution by natural selection outside of living systems. [1] Natural Selection Beyond Life? Observing the physico-chemical world through Darwinian glasses; 12-15 November 2019 - Institut d'Etudes Scientifiques, Cargèse, France

Here, I introduce a concept called autonomous selection to refer to a source of selection that is part of the individuals upon which it acts. The concept is motivated by a set of phenomena with the following characteristics: Natural selection shaped a variant (e.g., gene, epigenetic mark, or combination thereof) to act in a manner that reduces the frequency of one or more heritable traits of the individual in which it is located if those traits are detrimental to individual or group fitness. Phenomena with these characteristics are peculiar to traditional evolutionary theory but have been identified rather frequently in recent decades. They are also relevant to adaptive evolution: By reducing the frequency of a trait detrimental to fitness, the variant accelerates the evolution of adaptations, which allows its holders to adapt better to constantly changing environments. The variant is shaped by (natural) selection, but also does (autonomous) selection. Several phenomena with these characteristics have been invoked by proponents of the extended evolutionary synthesis (EES). The concept of autonomous selection helps resolve some of the controversy surrounding the EES: EES proponents call attention to the incompleteness of contemporary theory, emphasizing individuals’ processes that influence which adaptations those individuals evolve. I argue for the special importance of individuals’ processes that do not just influence those individuals’ adaptations, but also accelerate the adaptive evolution of those individuals. All known phenomena that fit this description are examples of autonomous selection. Other phenomena raised by EES proponents do not meet this threshold.

A basic problem in all postulated pathways of prebiotic chemistry is the low concentration which generally is expected for interesting reactants in fluid environments. Even though compounds like nucleobases, sugars or peptides principally may form spontaneously under environmental conditions, they will always be rapidly diluted in an aqueous environment. In addition, any such reaction leads to side products which often exceed the desired compound and generally hamper the first steps of a subsequent molecular evolution. Therefore, a mechanism of selection and accumulation of relevant prebiotic compounds seems to be crucial for molecular evolution. A very efficient environment for selection and accumulation can be found in the fluid continuum circulating in tectonic fault zones. Vesicles which form spontaneously at a depth of approximately 1 km present a selective trap for amphiphilic molecules, especially for peptides composed of hydrophilic and hydrophobic amino acids in a suitable sequence. The accumulation effect is shown in a numeric simulation on a simplified model. Further, possible mechanisms of a molecular evolution in vesicle membranes are discussed. Altogether, the proposed scenario can be seen as an ideal environment for constant, undisturbed molecular evolution in and on cell-like compartments, the latter offering preferential starting conditions for a subsequent RNA world.

Bacteria’s ability to withstand the detrimental effects of antimicrobials may take the form of resistance or tolerance with the minimum inhibitory concentration (MIC), the mutant prevention concentration (MPC), and the mutant selection window as salient concepts. Isolates exposed for 30 days to different concentrations of selected antibiotics, biocides, and heavy metals, singly and in combination, were additionally exposed to very high (15 × MIC) concentrations of ampicillin., and their tolerance was calculated the time to kill 99.9% of the isolate population (MDK99.9). These values were increased by 30 to 50% in test isolates compared to the untreated control. BAC 10-exposed isolates had the highest tolerance increase, and the tolerance appeared to originate from two sources, i.e., stochastic persistence and genetic-induced persistence, involving multiple genes using diverse mechanisms. The mutant selection window of the isolates to ampicillin, amoxicillin, and oxytetracycline also slightly increased compared to the control, indicating the amplification of persister cells during the 30-day exposure. These findings indicate that bacterial exposure to sub-inhibitory concentrations of environmental chemical stressors may not always result in the development of antimicrobial resistance but could initiate this process by selecting for persisters that could evolve into resistant isolates.

(1) Background Diabetic Retinopathy (DR) is the primary cause of poor vision in young adults. Screening for DR is important but many patients do not attend; (2) Methods: We validated an algorithm for predicting DR and its progression by conducting a retrospective study of 11 children in a population of 120,389 T2DM (3) Results: By applying the algorithm to the population showed an AUC of 0.93 (95% CI, 0.92–0.94) for any-DR and 0.90 (95% CI, 0.89–0.91) for referable-DR(4) Conclusions: The algorithm is useful for predicting patients who could develop referable forms of DR and also for any-DR. This would allow a personalized screening plan to be drawn up for each patient.

This work focuses on identifying the most effective machine learning techniques and supervised learning models to precisely estimate power output from Photovoltaic (PV) plants. The performance of various regression models is analyzed by harnessing experimental data, including Random Forest, Support Vector Regression (SVR), Multi-layer Perceptron (MLP), Linear Regressor (LR), Gradient Boosting, and k-Nearest Neighbors (KNN). The methodology applied starts with meticulous data preprocessing steps aimed at ensuring dataset integrity. Following the preprocessing phase, which entails eliminating missing values and outliers using Isolation Feature selection based on a correlation threshold, is performed to identify relevant parameters for accurate prediction in PV systems. Subsequently, Isolation Forest is employed for outlier detection, followed by model training and evaluation using key performance metrics such as Root Mean Squared Error (RMSE), Normalized Root Mean Squared Error (NRMSE), Mean Absolute Error (MAE), and R-squared (R2). Among the array of models evaluated, Random Forest emerges as the top performer, highlighting promising results with an RMSE of 19.413, NRMSE of 0.048% and an R2 score of 0.968. Furthermore, the best-performing model is integrated into a MATLAB application for real-time predictions, thereby enhancing usability and accessibility for a wide range of applications in renewable energy.

Waste management is an unavoidable technological operation in the process of raw material extraction. The main characteristic of this technological operation is the handling of large quantities of waste material, which can amount to several hundred million cubic metres. Working with this amount of material usually requires high-capacity systems for excavation and loading, a large fleet of trucks for haulage, construction, and maintenance of a complex roads network, use of a significant area of land in order to achieve the required capacities, etc. At the same time, this operation must comply with all administrative and environmental standards. Therefore, optimising waste rock management (particularly haulage and dumping) has the potential to significantly improve the overall value of the project. This paper presents a hybrid model for the optimisation of waste dump design and site selection. The model is based on different mathematical methods (genetic algorithm, analytic hierarchy process and heuristic methods) adapted to different aspects of the problem. The main objective of the model is to provide a solution (in analytical and graphical form) for the draft waste dump design, on the basis of which the final waste dump design can be defined.

Voice cloning, an emerging field in the speech processing area, aims to generate synthetic utterances that closely resemble the voices of specific individuals. In this study, we investigate the impact of various techniques on improving the quality of voice cloning, specifically focusing on a low-quality dataset. To contrast our findings, we also use two high-quality corpora for comparative analysis. We conduct exhaustive evaluations of the quality of the gathered corpora in order to select the most suitable audios for the training of a Voice Cloning system. Following these measurements, we conduct a series of ablations by removing audios with lower SNR and higher variability in utterance speed from the corpora in order to decrease their heterogeneity. Furthermore, we introduce a novel algorithm that calculates the fraction of aligned input characters by exploiting the attention matrix of the Tacotron 2 Text-to-Speech (TTS) system. This algorithm provides a valuable metric for evaluating the alignment quality during the voice cloning process. We present the results of our experiments, demonstrating that the performed ablations significantly increase the quality of synthesised audios for the challenging low-quality corpus. Notably, our findings indicate that models trained on a 3-hour corpus from a pre-trained model exhibit comparable audio quality to models trained from scratch using significantly larger amounts of data.

Like traditional single label learning, multi-label learning is also faced with the problem of dimensional disaster.Feature selection is an effective technique for dimensionality reduction and learning efficiency improvement of high-dimensional data. In this paper, Logistic regression, manifold learning and sparse regularization were combined to construct a joint framework for multi-label feature selection (LMFS). Firstly, the sparsity of the eigenweight matrix is constrained by the $L_{2,1}$-norm. Secondly, the feature manifold and label manifold can constrain the feature weight matrix to make it fit the data information and label information better. An iterative updating algorithm is designed and the convergence of the algorithm is proved.Finally, the LMFS algorithm is compared with DRMFS, SCLS and other algorithms on eight classical multi-label data sets. The experimental results show the effectiveness of LMFS algorithm.

Finding an optimal combination of features and classifier is still an open problem in the development of automatic heartbeat classification systems, especially when applications that involve resource-constrained devices are considered. In this paper, a novel study of the selection of informative features and the use of a random forest classifier while following the recommendations of the Association for the Advancement of Medical Instrumentation (AAMI) and an inter-patient division of datasets is presented. Features were selected using a filter method based on the mutual information ranking criterion on the training set. Results showed that normalized R-R intervals and features relative to the width of the QRS complex are the most discriminative among those considered. The best results achieved on the MIT-BIH Arrhythmia Database were an overall accuracy of 96.14% and F1-scores of 97.97%, 73.06%, and 90.85% in the classification of normal beats, supraventricular ectopic beats, and ventricular ectopic beats respectively. In comparison with other state of the art approaches tested under similar constraints, this work represents one of the highest performances reported to date while relying on a very small feature vector.

In reservoir operations rule curves, it is necessary to apply rule curves to guide long-term reservoir management. This paper proposes an approach to optimize the reservoir operation rule curves (RORC) using intelligent optimization techniques from the Firefly Algorithm (FA) and a unique combination method utilizing the Artificial Bees Colony and Cultural Algorithm (ABC-CA). The aim is to establish a connection with the simulation model to determine the optimal RORC for flood control. The proposed model was used to determine the Nam-Oon Reservoir (NOR) is optimal flood control RORC in Northeastern Thailand. The minimum frequency and a minimum average of ex-cess water were given as an objective function for assessing the efficiency of the search process. The evaluation of the effectiveness of flood control RORC involved expressing water scarcity and excess water situations in terms of frequency, magnitude, and duration using historical inflow data syn-thesized from 1000 events. The results demonstrate that when using the obtained RORC to simulate the NOR system for reducing flooding in long-term operations, situations of excess water were smaller than those using the current RORC. The results indicated that situations of excess water using the obtained RORC from the proposed model were smaller than those using the current RORC situations. In decreasing flood situations, the newly acquired RORC from the suggested FA and ABC-CA models performed better than the current RORC.

Maximum likelihood estimation (MLE) is a popular method for parameter estimation in both applied probability and statistics but MLE cannot solve the problem of incomplete data or hidden data because it is impossible to maximize likelihood function from hidden data. Expectation maximum (EM) algorithm is a powerful mathematical tool for solving this problem if there is a relationship between hidden data and observed data. Such hinting relationship is specified by a mapping from hidden data to observed data or by a joint probability between hidden data and observed data. In other words, the relationship helps us know hidden data by surveying observed data. The essential ideology of EM is to maximize the expectation of likelihood function over observed data based on the hinting relationship instead of maximizing directly the likelihood function of hidden data. Pioneers in EM algorithm proved its convergence. As a result, EM algorithm produces parameter estimators as well as MLE does. This tutorial aims to provide explanations of EM algorithm in order to help researchers comprehend it. Moreover some improvements of EM algorithm are also proposed in the tutorial such as combination of EM and third-order convergence Newton-Raphson process, combination of EM and gradient descent method, and combination of EM and particle swarm optimization (PSO) algorithm.

MAACS is a software architecture which layers multiple standard cipher algorithms together to increase the overall strength of the encrypted data stream, without modifying the standard algorithms, which have been heavily vetted from a cryptanalysis perspective and are already widely deployed. This layering technique makes the combination of algorithms significantly more resistant to traditional cryptanalysis attacks, while also addressing increased concerns over future quantum computing attacks against these algorithms. For example, concerns over published attacks against 256-bit AES and potential future attacks emanating from Grover’s algorithm and other unknowns in the quantum computing era are explored. Several approaches for evolving AES are considered. MAACS uses a concept termed "aperiodic modulation", whereby of a set of cryptographic algorithms are modified by an- other, independent software algorithm in an unpredictable, pseudo-random manner. In the MAACS reference architecture, a 256-bit ChaCha20 cryptographically secure pseudorandom number generator (CSPRNG) drives an aperiodic modulator that orchestrates encryption/decryption processes multiplexed across eight parallel 128-bit AES instances, yielding a cryptosystem with a composite strength of 1,376 bits or more in larger configurations.

The chicken poultry business is becoming a crucial sector for our nation's sustainable food supply. To increase the health of chickens in coops and maybe increase the output of chicken meat and eggs, several innovations and inventions have been developed. Therefore, the creation of an automated chicken feeding device might be highly beneficial for the expansion of the poultry sector. This equipment may take the role of a worker in the chicken feeding process, solving the industry's labor shortage and introducing a semi-automatic procedure. The main processor of the automated chicken feeding system is a Raspberry Pi 3 Model B+. The machine consists of five main components: a Raspberry Pi with an amplifier that makes noise to draw the attention of free-range chickens, a Raspberry Pi with a pi camera that counts and detects the chickens, a Raspberry Pi with a servomotor that moves the food from storage to a container, a Raspberry Pi with a load cell that controls the number of feeds to avoid waste on foods, and a Raspberry Pi with a temperature sensor that monitors the food's freshness. This enhances the coop's atmosphere while lowering labor costs, conserving food, and ensuring that the chickens are fed on time. It also regulates the temperature sensor to ensure that the chicken food is fresh and prevents food from becoming polluted by insects and chicken excrement.

We present a new method of estimating fitness of countries and complexity of products by exploiting a non-linear non-homogeneous map applied to the publicly available information on the goods exported by a country. The non homogeneous terms guarantee both convergence and stability. After a suitable rescaling of the relevant quantities, the non homogeneous terms are eventually set to zero so that this new method is parameter free. This new map reproduces the findings of the method proposed by Tacchella et al. [1], and allows for an approximate analytic solution in case of actual binarized matrices based on the Revealed Comparative Advantage (RCA) indicator. This solution is connected with a new quantity describing the neighborhood of nodes in bipartite graphs, representing in this work the relations between countries and exported products. Moreover, we define the new indicator of country net-efficiency quantifying how a country efficiently invests in capabilities able to generate innovative complex high quality products. Eventually, we demonstrate analytically the local convergence of the algorithm.

The use of phosphate-solubilizing fungi in coffee cultivation is an alternative with which to reduce the use of fertilizers. The objective of this study was to analyze the mechanisms involved in the phosphorus solubilization of the fungal strains and to evaluate the effect of a phosphate-solubilizing strain on the coffee plants. For this, phosphorus-solubilizing fungal strains were selected for evaluation of their solubilization potential and phosphatase activity. Coffee plants were inoculated in the field with a phosphate solubilizing strain, and soil and foliar soluble phosphorus, as well as coffee bean yield, were quantified. Of the 151 strains analyzed, Aspergillus niger, Penicillium waksmanii, and Penicillium brevicompactum showed the highest solubilization. Aspergillus niger and P. waksmanii presented the highest soluble phosphorus values; however, P. brevicompactum showed the highest phosphatase activity. The P. brevicompactum strain inoculated on the coffee plants did not favor foliar phosphorus content but increased the soil soluble phosphorus content in two of the coffee plantations. The plants inoculated with the phosphate solubilizing strain showed an increase in coffee bean weight on all plantations, although this increase was only significant in two of the three selected coffee plantations.

Solar concentration is the ability to harness solar radiation to increase the temperature of a receiver. The receiver is the component into which a heat transfer fluid can be flowed for an ORC system and produce electricity, or it can be used for high-temperature thermal storage, or even to implement thermochemical cycles. The choice of material is critical to ensure optimal performance and long-lasting operation. It is also essential that such material can operate at high temperatures and high thermal gradients. In short, material identification involves high thermal stresses that result in structural deformation. Different metal alloys were used to verify that the yield strength limit was not exceeded due to thermal stress induced by concentrated solar radiation. The problem was implemented in Matlab starting from the general heat equation. The purpose is to test whether thermal stress exceeds the yield strength, which is the condition in which elastic bonds in the material are changed, causing deformation. The best material identified was Inconel 740H, which had a high yield strength value and the lowest temperature difference. Under extreme working conditions, it can withstand thermally induced shocks.

Online speech enhancement is of great interest, because of its diverse areas of application. The Demucs architecture has been recently shown to achieve a high level of performance, even with small audio segments, while requiring a relatively small amount of computational resources. However, an issue that it bears, as well as most of state-of-the-art speech enhancement techniques, is that of target speech selection: it is assumed that only one speech source is present. However, in real-life scenarios, more than one speech source may be present, in it is uncertain which speech source within the fed mixture should be enhanced. Thus, it is of interest to complement speech enhancement techniques (such as Demucs-based) with a target selection scheme, so as to ensure that only the source of interest is enhanced. In this work, two target selection strategies are explored: 1) an embedding-based strategy, using a codified sample of the target speech, and 2) a location-based strategy, using a beamforming-based pre-filter to select the target that is in front of a 2-microphone array. It is shown that while both strategies improve the performance of the Demucs-based technique when one or more speech interferences are present, they both have their pros and cons. Specifically, while the beamforming-based strategy achieves overall a better performance compared to the embedding-based strategy, it is sensitive against the location variation of the target speech source which the embedding-based strategy does not suffer from.

In this paper study, we develop a Bayesian Network model selection principle that address addresses the incommensurability of network features obtained from incongruous datasets and overcomes performance irregularities of the Minimum Description Length model selection principle. This is achieved (i) by approaching model evaluation as a classification problem, (ii) by estimating the effect that sampling error has on the satisfiability of conditional independence criterion, as reflected by Mutual Information, and (iii) by utilizing this error estimate to penalize uncertainty in the Minimum Uncertainty (MU) model selection principle. We validate our findings numerically and demonstrate the performance advantages of the MU criterion. Finally, we illustrate the advantages of the new model evaluation framework on a tRNA structural biology example.