The raw material purchasing (RMP) problem is to determine the purchasing quantities of raw materials in given periods or cycles. Raw material purchasing optimization is crucial for large-scale steel plants because it is closely related to the supply of raw materials and cost savings. The raw material purchasing of large-scale steel enterprises is characterized by many varieties, large quantities, and high costs. The RMP objective is to minimize the total purchasing cost consisting of the price of raw materials, purchasing set-up costs, and inventory costs and meet product demand. We present a mixed integer linear programming (MILP) model and a column generation (CG) solution for the resulting optimization problem. The column generation algorithm is the generalization of the branch & bound algorithm with solving the linear programming (LP) relaxation of MILP using column generation (CG), and its advantage is to handle large-sized MILPs. Experimental results show the effectiveness and efficiency of the solution.

Clustering is a crucial at the same time challenging task in several application domains. It is important to incorporate the optimum feature finding into our clustering algorithms for getting better prediction accuracy but this is difficult when there is no or little information about the importance or relevance of features. To tackle this task in an efficient manner we employ the natural evolution process inherent in genetic algorithms (GA) to find the optimum features for clustering for the healthy aging dataset. In order to empirically verify the findings, genetic algorithms were combined with a number of clustering algorithms including parti-tional, density based as well as agglomerative. A variant of the popular KMeans algorithm, named KMeans++ gave the best performance on all performance metrics when combined with GA.

Nowadays, we live in a world in which people are facing with a lot of data that should be stored or displayed. One of the key methods to control and manage this data refers to grouping and classifying them in clusters. Today, clustering has a critical role in information retrieval methods for organizing large collections inside a few significant clusters. One of the main motivations for the use of clustering is to determine and reveal the hidden and inherent structure of a set of data. Ensemble clustering algorithms combine multiple clustering algorithms to finally reach an overall clustering system. Ensemble clustering methods by lack of information fusing utilize several primary partitions of data to find better ways. Since various clustering algorithms look at the different data points, they can produce various partitions from such data. It is possible to create a partition with high performance by combining the partitions obtained from different algorithms, even if the clusters to be very dense from each other. Most studies in this area have examined all the initial clusters. In this study, a new method is used in which the most sustainable clusters are utilized instead of all primary produced clusters. Consensus function based on co-association matrixes used to select more stable clusters. The most stable clusters selection method is done by cluster stability criterion based on F-measure. Optimization functions are used to optimize the obtained final clusters. The genetic algorithm is the optimizer used in this article to find the ultimate clusters participated in a consensus. Experimental results on several datasets show that the output of proposed method is various clusters with high stability.

Survivability is a critical concern in WSNs, heavily influenced by energy efficiency. Addressing severe energy constraints in WSNs requires solutions that meet application goals while prolonging network life. This paper presents an energy optimization approach (EOAMRCL) for WSNs, integrating the Grey Wolf Optimization (GWO) for enhanced performance. EOAMRCL aims to enhance energy efficiency by selecting the optimal duty-cycle schedule, transmission power, and routing paths. The proposed approach employs a centralized strategy using a hierarchical network architecture. During the cluster formation phase, an objective function, augmented with GWO, determines the ideal cluster heads (CHs). The routing protocol then selects routes with minimal energy consumption for data transmission to CHs, using transmission power as a metric. In the transmission phase, the MAC layer forms a duty-cycle schedule based on cross-layer routing information, enabling nodes to switch between active and sleep modes according to their network allocation vectors (NAV). This process is further optimized by an enhanced CSMA/CA mechanism, which incorporates sleep/activate modes and pairing nodes to alternate between active and sleep states. This integration reduces collisions, improves channel assessment accuracy, and lowers energy consumption, thereby enhancing overall network performance. EOAMRCL was evaluated in a MATLAB environment, demonstrating superior performance compared to EEUC, DWEHC, and CGA-GWO protocols, particularly in terms of network lifetime and energy consumption. This highlights the effectiveness of integrating GWO and the updated CSMA/CA mechanism in achieving optimal energy efficiency and network performance.

Asymmetric lithium salts, such as Lithium (difluoromethanesulfonyl)(trifluoromethanesulfonyl)imide (LiDFTFSI), have been demonstrated to surpass traditional symmetric lithium salts with improved Li+ conductivity and the capacity to generate stable solid electrolyte interphase (SEI) while maintaining compatibility with aluminum (Al0) current collector. However, the intrinsic reductive mechanism through which LiDFTFSI influences battery performance remains unclear and under debate. Herein, the detailed SEI reactions of LiDFTFSI-based electrolytes were investigated by combining density functional theory and molecular dynamics, aiming to clarify the formation process and atomic structure of SEI. Our results show that asymmetric DFTFSI– weakens the interaction between carbonate solvents and Li+, and substantially alter the solvation structure, exhibiting a well-balanced coordination capacity to bis(trifluoromethanesulfonyl)imide (TFSI–). Nanoseconds hybrid molecular dynamics simulation further reveals that the preferential decomposition of LiDFTFSI produces sufficient LiF and Li2O to facilitate a robust SEI. Moreover, the abundant F– generated from LiDFTFSI decomposition accumulates on the Al surface and subsequently combines with Al3+ from the current collector to form AlF3, potentially inhibiting corrosion of the current collector. Overall, these findings elucidate how LiDFTFSI regulates the solvation sheath and SEI structure, advancing the development of high-performance electrolytes compatible with current collector.

This investigation explores the potential of enhancing aqueous zinc-ion batteries (AZIBs) through the introduction of a novel cathode material, NH4V4O10 (NVO), combined with reduced graphene oxide (rGO). Utilizing Density Functional Theory (DFT), it was hypothesized that the incorpora-tion of rGO would increase the interlayer spacing of NVO and diminish the charge transfer in-teractions, thus promoting enhanced diffusion of Zn2+ ions. These theoretical predictions were substantiated by experimental data acquired from hydrothermal synthesis, which indicated a marked increase in interlayer spacing. Significantly, the NVO-rGO composite exhibits remarkable cyclic durability, maintaining 95% of its initial specific capacity of 507 mAh g−1 after 600 cycles at a current density of 5 A g−1. The electrochemical performance of NVO-rGO not only surpasses that of pristine NVO but also outperforms the majority of existing vanadium oxide cathode materials reported in the literature. This study underscores the effective integration of theoretical insights and experimental validation, contributing to the advancement of high-performance energy storage technologies.

This study explores the enhancement of aqueous zinc-ion batteries (AZIBs) using ammonium-enhanced vanadium oxide cathodes. Density Functional Theory (DFT) calculations reveal that NH₄⁺ incorporation into V₆O₁₆ lattices significantly facilitates Zn²⁺ ion diffusion by reducing electrostatic interactions, acting as a structural lubricant. Subsequent experimental validation using (NH₄)₂V₆O₁₆ cathodes synthesized via a hydrothermal method corroborates the DFT findings, demonstrating remarkable electrochemical stability with a capacity retention of 90% after 2000 cycles at 5 A g⁻¹. These results underscore the potential of NH₄⁺ in improving the performance and longevity of AZIBs, providing a pathway for sustainable energy storage solutions.

This study presents the synthesis and electrochemical evaluation of nitrogen-doped vanadium oxide (N-V2O3/C) as a cathode material for aqueous zinc-ion batteries (AZIBs), using a hydrothermal method. Compared to undoped V2O3/C, N-V2O3/C exhibits enhanced electrical conductivity, capacity, and electrochemical kinetics, attributed to the incorporation of pyridinic and pyrrolic nitrogen. Initial charge-discharge cycles indicate phase transitions to amorphous vanadium oxides, enhancing conductivity. N-V2O3/C shows a high specific capacity of 168.4 mAh g−1 at 10 A g−1 and remarkable reversibility, highlighted by the transient existence of intermediate species during cycling. Optimal electrochemical performance is achieved with a vanadium to nitrogen molar ratio of 2:3, indicating the significant impact of nitrogen doping concentration on the material’s efficiency. This work underscores the potential of N-V2O3/C as a superior cathode material for AZIBs.

Using density functional theory (DFT), the density of states of NH4V3O8 (NVO) was analyzed pre and post-oxygen defects (Od) formation. The findings revealed a reduced bandgap in NVO after Od introduction, emphasizing the role of Od in enhancing conductivity of the material, thus improving its electrochemical attributes. Through the water bath method, both NVO and its oxygen-deficient counterpart, (NH4)2V10O25⸱8H2O (NVOd), were synthesized as potential cathode materials for aqueous zinc-ion batteries (AZIBs). Experimental outcomes resonated with DFT predictions, highlighting the beneficial role of oxygen defects in boosting electrical conductivity. Notably, the refined material displayed a remarkable capacity of 479.3 mAh g-1 at 0.1 A g-1, underscoring its promise for advanced energy storage solutions.

With the significant annual increase in the market demand for biopesticides, the industrial production demand for predatory mites, which hold the largest market share among biopesticides, has also been rising.To achieve efficient and low energy consumption control of predatory mite breeding environmental parameters, accurate estimation of breeding environmental parameters is necessary. This paper collects and pre-processing hourly time-series data of temperature and humidity from industrial breeding environments. Time series prediction models such as SVR, LSTM, GRU, and LSTNet are applied to model and predict historical data of the breeding environment. Experiments validate that the LSTNet model is more suitable for such environmental modeling. To further improve prediction accuracy, the training data for the LSTNet model is enhanced using hierarchical clustering of time-series features. After augmentation, the root mean square error (RMSE) of temperature prediction decreased by 27.3%, and the RMSE of humidity prediction decreased by 32.8%, significantly improving the accuracy of multi-step predictions and providing substantial industrial application value.

This study reports on the development of bio-based hydrophobic coatings for packaging papers through deposition of polyhydroxybutyrate (PHB) particles in combination with nanofibrillated cellulose (NFC) and plant wax. In a first approach, PHB particles in micrometer range (PHB-MP) were prepared through a phase-separation technique providing internally nanosized structures. The particles were transferred as a coating by dip-coating filter papers in the particle suspension, followed by sizing with a carnauba wax solution. This approach allowed partial to almost full surface coverage of PHB-MP over the paper surface resulting in static water contact angles of 105° to 122° and 129° to 144° after additional wax coating. In a second approach, PHB particles with submicron sizes (PHB-SP) were synthesized by an oil-in-emulsion (o/w) solvent evaporation method, and mixed in aqueous suspensions with 0 to 7 wt% NFC. After dip-coating filter papers in PHB-SP/NFC suspensions and sizing with a carnauba wax solution, static water contact angles of 112° to 152° were obtained. The intrinsic properties of the particles were analyzed by scanning electron microscopy, thermal analysis and infrared spectroscopy, indicating higher crystallinity for PHB-SP than PHB-MP. The chemical interactions between the more amorphous PHB-MP particles and paper fibers were identified as an esterification reaction, while the morphology of the NFC fibrillar network was playing a key role as binding agent in the retention of more crystalline PHB-SP at the paper surface, hence contributing to higher hydrophobicity.

The extensive utilization of drones has led to numerous scenarios that encompass both advantageous and perilous outcomes. By using deep learning techniques, it is aimed to reduce the dangerous effects of drone use through early detection of drones.The state of the art of the study is evaluation of deep learning approaches such as pre trained YOLOv8 drone detection for security issues. In this study, dataset collected by Mehdi Özel for a UAV competition are sourced from GitHub. These images are labeled using Roboflow, and the model is trained on Google Colab. To enhance model performance, dataset augmentation techniques including rotation and blurring are implemented. Following these steps, a significant precision value of 0.946, a notable recall value of 0.9605 and a considerable precision-recall curve value of 0.978 are achieved, surpassing many popular models such as Mask CNN, CNN, and YOLOv5.

This paper describes a stochastic clustering architecture that is used in the paper for making predictions over energy data. The design is discrete, localised optimisations based on similarity, followed by a global aggregating layer, which can be compared with the recent random neural network designs, for example. The topic relates to the IDEAS Smart Home Energy Project, where a client-side Artificial Intelligence component can predict energy consumption for appliances. The proposed data model is essentially a look-up table of the key energy bands that each appliance would use. Each band represents a level of consumption by the appliance. This table can replace disaggregation from more complicated methods, usually constructed from probability theory, for example. Results show that the table can accurately disaggregate a single source to a set of appliances, because each appliance has quite a unique energy footprint. As part of predicting energy consumption, the model could possibly reduce costs by 50% and more than that if the proposed schedules are also included. The hyper-grid has been changed to consider rows as single units, making it more tractable. A second case study considers wind power patterns, where the grid optimises over the dataset columns in a self-similar way to the rows, allowing for some level of feature analysis.

This work presents a novel approach for the study of the movement of droplets on inclined surfaces under the influence of gravity and chemical heterogeneities. The developed numerical methodology uses data-driven modeling to extend the applicability limits of an analytically derived reduced-order model for the contact line velocity. More specifically, while the reduced-order model is able to capture the effects of the chemical heterogeneities to a satisfactory degree, it does not account for gravity. To alleviate this shortcoming, datasets generated from direct numerical simulations are used to train a data-driven model for the contact line velocity, which is based on the Fourier neural operator and corrects the reduced-order model predictions to match the reference solutions. This hybrid surrogate model, which comprises of both analytical and data-driven components, is then integrated in time to simulate the droplet movement, offering a speedup of five orders of magnitude compared to direct numerical simulations. The performance of this hybrid model is quantified and assessed in different wetting scenarios, by considering various inclination angles and values for the Bond number, demonstrating the accuracy of the predictions as long as the adopted parameters lie within the ranges considered in the training dataset.

As a member of smart materials, electrorheological elastomers (EREs) formed by pre-treating active electrorheological particles are attracting more and more attention. In this work, four Mg-doped strontium titanate particles with spherical, dendritic, flake-like and pinecone-like morphorlogies were obtained by hydrothermal and low-temperature co-precipitation. XRD, SEM, Raman and FT-IR were used to characterize the obtained products. The results showed that the sizes of Mg-doped strontium titanates are about 1.5‒2.0 μm, and the phase structure are dominated by cubic crystal. These Mg-doped strontium titanates were dispersed in a hydrogel composite elastic medium. Then, Mg-doped strontium titanate/glycerol/gelatin electrorheological composite hydrophilic elastomers were obtained with or without electric field. The electric field response properties of Mg-doped strontium titanate composite elastomers were investigated. It concluded that dendritic Mg-doped strontium titanate composite elastomers is high-performance EREs. And the maximum value of energy storage modulus of Mg-doped strontium titanate composite elastomers has achieved 8.70 MPa. This high electrorheological performance of the products is helpful for their applications in vibration control, force transducers, smart structures, dampers, and other fields.

This paper numerically investigates a 3D mesh independency study of a straight blade horizontal axis tidal turbine modelled using Computational Fluid Dynamics (CFD). The solution was produced by employing two turbulence models, the standard k-ε model and Shear Stress Transport (SST) in ANSYS CFX. Three parameters were investigated: mesh resolution, turbulence model, and power coefficient in the initial CFD, analysis. It was found that the mesh resolution and the turbulence model affect the power coefficient results. The power coefficients obtained from the standard k-ε model are 15% to 20% lower than the accuracy of the SST model. It can also be demonstrated that the torque coefficient increases with the increasing Tip Speed Ratio (TSR), but drops drastically after TSR = 5 and k-ε model failing to capture the non-linearity in the torque coefficient with the increasing TSR.

In recent years, new metaheuristic algorithms have been developed taking as reference the inspiration on biological and natural phenomena. This nature-inspired approach for algorithm development has been widely used by many researchers in solving optimization problem. These algorithms have been compared with the traditional ones algorithms and have demonstrated to be superior in complex problems. This paper attempts to describe the algorithms based on nature, that are used in fuzzy clustering. We briefly describe the optimization methods, the most cited nature-inspired algorithms published in recent years, authors, networks and relationship of the works, etc. We believe the paper can serve as a basis for analysis of the new are of nature and bio-inspired optimization of fuzzy clustering.

In this paper, carbon nanotubes modified screen-printed electrode (CNTs/SPE) was prepared and the CNTs/SPE was employed for the electrochemical determination of antioxidant substance Chlorogenic acids (CGAs). A pair of well-defined redox peak of CGA was observed at the CNTs/SPE in 0.10 mol∙L^-1 acetic acid-sodium acetate buffer (pH 6.2) and electrode process is adsorption-controlled. Cyclic voltammetry (CV) and differential pulse voltammetry (DPV) method for the determination of CGA were proposed based on the CNTs/SPE. Under the optimal conditions, the proposed method exhibited linear ranges from 4.73×10^-7 to 4.45×10^-5 mol∙L^-1, the linear regression equation was Ipa(µA) = 4.1993 C (mol∙L^-1)+1.1039 (r = 0.9976) and the detection limit for CGA could reach 3.25×10^-6 mol∙L^-1. The recovery of matrine was 94.74~106.65% (RSD = 2.92%) in coffe beans. The proposed method is quick, sensitive, reliable, and can be used for the determination of CGA.

Proteomics research has become one of the most important topics in the fields of life science and natural science. At present, research on protein–protein interaction networks (PPINs) mainly focuses on detecting protein complexes or function modules. However, existing approaches are either ineffective or incomplete. In this paper, we investigate function module detection mechanisms in PPIN, including open databases, existing detection algorithms and recent solutions. After that, we describe the proposed solution based on simplified swarm optimization (SSO) algorithm and gene ontology knowledge. The proposed solution implements SSO algorithm for clustering proteins with similar function, and imports biological gene ontology knowledge for further identifying function complexes and improving detection accuracy. Furthermore, we use four different categories of species dataset for experiment: Fruitfly, Mouse, Scere, and Human. The testing and analysis result show that the proposed solution is feasible, efficient and could achieve a higher accuracy of prediction than existing approaches.

The majority of existing numerical simulations of the effect of bridge piers on water movement are based on a limited number of bridge piers at a laboratory scale. Furthermore, some 2D numerical simulations for actual bridge projects have deficiencies, including the use of overly large mesh sizes and an inadequate treatment of bridge piers. In this study, we compare three methods of structural mesh encryption, suspension mesh, and nonstructural mesh based on Delft3D, and apply the optimization scheme to a real bridge project. It is demonstrated that optimal results can be achieved by utilising a grid size comparable to the pier diameter (Dp) in the region away from the piers. In the vicinity of the piers, the grid cell size should be no larger than 1/9 Dp. The suspended grid technique (DD Boundary) can yield results consistent with those obtained using a full-area high-resolution grid, provided that the total number of grids can be reduced and the computational time is considerably reduced. In this study, the unstructured mesh (Deflt3D Flexible Mesh) scheme was unable to capture the oscillations of the wake flow behind the bridge piers. However, the application of the optimized scheme in bridge engineering has demonstrated its practical value. The findings of this study on mesh resolution and suspension mesh scheme can be applied to the Delft3D software and are also useful for other numerical simulation work.

Intrahepatic cholangiocarcinoma (ICCA) is a malignant epithelial neoplasm characterized by biliary differentiation within the liver. ICCA is molecularly heterogeneous and exhibits a broad spectrum of histopathological features. It is a highly aggressive carcinoma with high mortality and poor survival rates. ICCAs are classified into two main subtypes: small duct type and large duct types. These two tumor types have different cell origins and clinicopathological features. ICCAs are characterized by numerous molecular alterations, including mutations in KRAS, TP53, IDH1/2, ARID1A, BAP1, BRAF, SAMD4, and EGFR, and FGFR2 fusion. Two main molecular subtypes–inflammation and proliferation–have been proposed. Recent advances in high-throughput assays using next-generation sequencing have improved our understanding of ICCA pathogenesis and molecular genetics. The diagnosis of ICCA poses a significant challenge for pathologists because of its varied morphologies and phenotypes. Accurate diagnosis of ICCA is essential for effective patient management and prognostic determination. This article provides an updated overview of ICCA pathology, focusing particularly on molecular features, histological subtypes, and diagnostic approaches.

This paper investigates an innovative photovoltaic cell configuration, denoted as “Au/CuSCN/RbGeI3/CdTe/ZnO/TiO2/FTO", using SCAPS-1D simulation. The research focuses on optimizing device performance by analyzing key components, including ZnO as the electron transport layer (ETL), RbGeI3 as the perovskite absorber layer, CuSCN as the hole transport layer (HTL), and CdTe as the active buffer layer. A comparison is made with the standard “Au/CuSCN/CH3NH3SnI3/CdTe/ZnO/TiO2/FTO" configuration under dark and illuminated conditions. Through an in-depth investigation involving temperature effects, generation rate analysis, RbGeI3 absorber layer thickness, Nd level, and interface defect levels, an optimized design for a unit area is achieved. The proposed solar cell demonstrates outstanding performance metrics, including an open circuit voltage (Voc) of 0.94V, a short circuit current density (Jsc) of 34.52mA/cm2, a fill factor (FF) of 77.77%, and an energy conversion efficiency (η) of 25.40%. These values significantly outperform the reference models with energy conversion efficiencies of 10.11% and 21.09%. Real-world applicability is validated by implementing these optimized characteristics in a photovoltaic system for Pakistan’s geographical location using PVSyst software. The suggested solar cell achieves a remarkable performance ratio (PR) of 85.6%, surpassing the PR of the reference basic solar cell model at 83%. The findings of this research offer a promising and superior solar cell design, incorporating innovative materials and optimization techniques to achieve exceptional energy conversion efficiency and overall performance. This study’s outcomes have the potential to advance photovoltaic technology and contribute to sustainable energy solutions worldwide.

Vibration problems have become one of the most important factors affecting robot performance. To this end, a terminal residual vibration suppression method based on joint trajectory optimization is proposed to improve the accuracy and stability of robot motion. Firstly, based on the characteristics of the friction nonlinearity due to joint coupling and physical feasibility of dynamic parameters, a semidefinite programming method is used to identify dynamic parameters with actual physical meaning, thereby obtaining an accurate dynamic model. Then, based on the result of the residual vibration time domain analysis, a joint trajectory optimization model with the goal of minimizing joint tracking error is established. The Chebyshev collocation method is used to discretize the optimization model. The dynamic model is used as the optimization constraint, and barycentric interpolation is used to obtain the optimized joint motion trajectory. Finally, industrial robot experiments prove that the vibration suppression method proposed in this article can reduce the maximum acceleration amplitude of residual vibration by 62% and the vibration duration by 71%. Compared with the input shaping method, the method proposed in this paper can reduce the terminal residual vibration more effectively and ensure the consistency of running time and trajectory.

The climate crisis necessitates a global shift to achieve a secure, sustainable, and affordable energy system toward a green energy transition reaching climate neutrality by 2050. Because of this, renewable energy sources have come to the forefront and the research interest in microgrids which rely on distributed generation and storage systems has exploded. Furthermore, many new markets for energy trading, ancillary services, and frequency reserve markets have provided attractive investment opportunities in exchange for balancing the supply and demand of electricity. Artificial intelligence can be utilized to locally optimize energy consumption, trade energy with the main grid, and participate in these markets. Reinforcement learning (RL) is one of the most promising approaches to achieve this goal because it enables an agent to learn optimal behavior in a microgrid by executing specific actions that maximize the long-term reward signal/function. The study focuses on testing two optimization algorithms: logic-based optimization and reinforcement learning. This paper proposes an optimization algorithm based on reinforcement learning in an industrial microgrid that is capable of trading energy with the main grid, providing significant cost savings. The RL-based approach is implemented in Python based on real data from the site and in combination with MATLAB-Simulink to validate its results. The application of the RL algorithm achieved an average monthly cost saving of 20% compared to logic-based optimization and 86% savings compared to not using any optimization. These findings contribute to digitalization and decarbonization of energy technology and support fundamental goals and policies of the European Green Deal.

Mixing is considered as a critical process parameter (CPP) during process development due to its significant influence on reaction selectivity and process safety. Nevertheless, mixing issues are difficult to identify and solve owing to their complexity and dependence on knowledge of kinetics and hydrodynamics. In this paper, we proposed an optimization methodology using Computational Fluid Dynamics (CFD) based compartmental modelling to improve mixing and reaction selectivity. More importantly, we have demonstrated that through the implementation of surrogate-based optimization, the proposed methodology can be used as a computationally non-intensive way for rapid process development of reaction unit operations. For illustration purpose, reaction selectivity of a process with Bourne competitive reaction network is discussed. Results demonstrate that we can improve reaction selectivity by dynamically controlling rates and locations of feeding in the reactor. The proposed methodology incorporates mechanistic understanding of the reaction kinetics together with an efficient optimization algorithm to determine the optimal process operation and thus can serve as a tool for quality-by-design (QbD) during product development stage.

Background: Circulating rare cells participate in breast cancer evolution as systemic components of the disease and thus, are a source of theranostic information. Exploration of cancer-associated rare cells is in its infancy. We determined the validity of a rare-cell detection platform and demonstrated the usefulness of a certain rare cell subset as a novel approach to characterize the breast cancer system. Methods: Linearity of the Rarmax® platform was established using a spike-in approach. The platform includes red blood cell lysis, leukocyte depletion and high-resolution fluorescence image recording. Rare cell analysis was conducted on 28 samples (before and after surgery) from 14 patients with breast cancer, 20 healthy volunteers and 9 non-cancer control volunteers. In-depth identification of rare cells, including circulating tumor cells, endothelial-like cells, erythroblasts and inflammation-associated cells, was performed using a phenotype and morphology-based classification system. Results: The platform performed linearly over a range of 5-950 spiked cells, with an average recovery of 84.6%. Circulating epithelial and endothelial-like cell subsets have been demonstrated to be associated with or independent of cancer with tumor presence. Furthermore, certain cell patterns may be associated with treatment-related adverse effects. The sensitivity in detecting tumor-presence and cancer-associated abnormality before surgery was 50% and 85.7%, respectively and the specificity was 100% and 96.6%, respectively. Conclusion: The present study supports the idea of a cancer-associated rare cell abnormality to represent tumor entities as well as systemic cancer. The latter is independent of the apparent clinical cancer.

The goal of clustering is to identify common structures in a data set by forming groups of homogeneous objects. The observed characteristics of many economic time series motivated the development of classes of distributions that can accommodate properties such as heavy tails and skewness. Thanks to its flexibility, the Skewed Exponential Power Distribution (also called Skewed Generalized Error Distribution) ensures a unified and general framework for clustering possibly skewed and heavy tailed time series. This paper develops a clustering procedure of model-based type, assuming that the time series are generated by the same underlying probability distribution but with different parameters. Moreover, we propose to optimally combine the estimated parameters to form the clusters with an entropy weighing $k$-means approach. The usefulness of the proposal is showed by means of application to financial time series, demonstrating also how the obtained clusters can be used to form portfolio of stocks.

In the field of machine learning, cluster analysis has always been a very important technology for determining useful or implicit characteristics in the data. However, the current mainstream cluster analysis algorithms require comprehensive analysis of the overall data to obtain the best parameters in the algorithm. As a result, handling large-scale datasets would be difficult. This research proposes a distributed related clustering mechanism for Unsupervised Learning, which assumes that if adjacent data are similar, a group can be formed by relating to more data points. Therefore, when processing data, large-scale datasets can be distributed to multiple computers, and the correlation of any two datasets in each computer can be calculated simultaneously. Later, results are processed through aggregation and filtering before assembled into groups. This method would greatly reduce the pre-processing and execution time of the dataset; in practical application, it only needs to focus on how the relevance of the data is designed. In addition, the experimental results show the accuracy, applicability, and ease of use of this method.

Data is present in the data sources like Files and Data bases, Retrieval of information from that data sources is one of the important issue nowadays. So for retrieval information from the data sources clustering is used. In the present market different types of clustering algorithms were available. But opting of the clustering is based on user requirements. This paper focuses on the study of hierarchical clustering approach on different conditions or measures or with customer choices like clustering process number of clusters generated at each level, number of levels, attributes range for performing the clustering on the given data set. In brief overview we discuss the hierarchical approach for clustering algorithm with the user opting choices.

In recent years, governments applied intelligent transportation system (ITS) technique to provide several convenience services (e.g., garbage truck app) for residents. This study proposes a garbage truck fleet management system (GTFMS) and data feature selection and data clustering methods for travel time prediction. A GTFMS includes mobile devices (MD), on-board units, fleet management server, and data analysis server (DAS). When user uses MD to request the arrival time of garbage truck, DAS can perform the procedure of data feature selection and data clustering methods to analyses travel time of garbage truck. The proposed methods can cluster the records of travel time and reduce variation for the improvement of travel time prediction. After predicting travel time and arrival time, the predicted information can be sent to user’s MD. In experimental environment, the results showed that the accuracies of previous method and proposed method are 16.73% and 85.97%, respectively. Therefore, the proposed data feature selection and data clustering methods can be used to predict stop-to-stop travel time of garbage truck.

Particulate organic carbon (POC) is a pivotal component within the marine carbon cycle, actively involved in diverse biogeochemical processes. This study focuses on Mediterranean as the research region, selecting the most influential factors from 47 potential ones influencing surface POC. Using geographic detector for factor identification, ten primary influencers were identified. Preliminarily optimized random forest (BRF), backpropagation neural network, adaptive boosting, and extreme gradient boosting were utilized to construct POC assessment models. Notably BRF exhibited superior performance in estimating the sea surface POC. Further optimization of RF using the tuneRanger R package resulted in R² of 0.868, mean squared error of 1.119 (mg/m³) ², and mean absolute error of 1.041 (mg/m³). Surface POC concentrations in the Mediterranean for May and June 2017 were estimated. Spatial distribution analysis unveiled higher concentrations in the west, lower in the east, higher in the north, lower in the south, with higher levels near the coast and lower far from the coast. Additionally, the study deliberated on the impact of human activities on surface POC in the Mediterranean. This research contributes a high-precision method for satellite retrieval of surface POC concentrations in the Mediterranean, thereby enriching the understanding of POC dynamics in the area.

In GNSS/IMU integrated navigation systems, factors such as satellite occlusion and non-line-of-sight conditions can lead to degradation of satellite positioning results, Subsequently affecting the overall accuracy of the integrated navigation system. To address this issue and ef-fectively utilize historical pseudorange information from satellites, this paper proposes a graph optimization-based GNSS/IMU model with virtual constraints. These virtual constraints are con-structed using satellite ‘s position from previous time step, the rate of change of pseudoranges, and ephemeris data. This virtual constraint can serve as an alternative solution for individual satellites in case of signal anomalies, ensuring the integrity and continuity of the graph optimi-zation model. Additionally, this paper conducts an analysis of the graph optimization model constructed using these virtual constraints, comparing it with traditional integrated navigation graph optimization model, and analyzes and reconstructs the marginalization process based on these virtual constraints. The experimental results, compared with tightly coupled Kalman fil-tering and the original graph optimization method on a set of real-world data, demonstrate that the introduction of virtual pseudoranges maintains high positioning accuracy. The RMSE error between it and the original graph optimization remains within 5%, affirming the high feasibility of this approach.

Chinese texts often feature a substantial volume of normative content, and their analysis has increasingly become a focal point in recent semantic analysis endeavors. Enhancing the effectiveness of text classification and clustering is pivotal in unveiling the intricate semantics within extensive textual data. Empirical research within the realm of computational social science has underscored the need for improved explanatory power when it comes to general text clustering methods applied to normative texts. This study introduces an innovative hierarchical clustering method that incorporates part-of-speech (POS) features and pioneers a novel semantic network model. It achieves this by amalgamating a POS-based feature weight calculation method with hierarchical clustering techniques. To assess its efficacy, the method is rigorously evaluated across three diverse text datasets, encompassing normative reports, news articles, and social media content. The experimental results unequivocally demonstrate the superior performance of the POS-HC method, surpassing the traditional TF and TF-IDF feature extraction methods in terms of clustering accuracy, and surpassing some existing clustering methods. Furthermore, its classification effectiveness exhibits notable advantages, particularly in the semantic classification of normative texts.

Clustering algorithms for multi-database mining (MDM) rely on computing $(n^2-n)/2$ pairwise similarities between $n$ multiple databases to generate and evaluate $m\in[1, (n^2-n)/2]$ candidate clusterings in order to select the ideal partitioning which optimizes a predefined goodness measure. However, when these pairwise similarities are distributed around the mean value, the clustering algorithm becomes indecisive when choosing what database pairs are considered eligible to be grouped together. Consequently, a trivial result is produced by putting all the $n$ databases in one cluster or by returning $n$ singleton clusters. To tackle the latter problem, we propose a learning algorithm to reduce the fuzziness in the similarity matrix by minimizing a weighted binary entropy loss function via gradient descent and back-propagation. As a result, the learned model will improve the certainty of the clustering algorithm by correctly identifying the optimal database clusters. Additionally, in contrast to gradient-based clustering algorithms which are sensitive to the choice of the learning rate and require more iterations to converge, we propose a learning-rate-free algorithm to assess the candidate clusterings generated on the fly in a fewer upper-bounded iterations. Through a series of experiments on multiple database samples, we show that our algorithm outperforms the existing clustering algorithms for MDM.

An adaptive spatial clustering (ASC) algorithm is proposed in this present study, which employs sweep-circle techniques and a dynamic threshold setting based on the Gestalt theory to detect spatial clusters. The proposed algorithm can automatically discover clusters in one pass, rather than through the modification of the initial model (for example, a minimal spanning tree, Delaunay triangulation or Voronoi diagram). It can quickly identify arbitrarily-shaped clusters while adapting efficiently to non-homogeneous density characteristics of spatial data, without the need of prior knowledge or parameters. The proposed algorithm is also ideal for use in data streaming technology with dynamic characteristics flowing in the form of spatial clustering in large data sets.

With the increasing use of data-driven modeling methods new approaches to complex problems in the field of wind energy can be addressed. Topics reviewed through literature include wake modeling, performance monitoring and controls applications, condition monitoring and fault detection, and other data-driven research. Literature shows the advantages of data-driven methods reduce computational expense or complexity, particularly in the cases of wake modeling and controls, as well as various data-driven methodologies’ aptitude for predictive modeling and classification, as in the cases of fault detection and diagnosis. Significant work exists for fault detection while less work is found for controls applications. A methodology for creating data-driven wind turbine models for arbitrary performance parameters is proposed. Results are presented utilizing the methodology to create wind turbine models relating active adaptive twist to steady-state rotor thrust as a performance parameter of interest. Resulting models are evaluated by comparing root-mean-square-error (RMSE) on both the training and validation data sets, with Gaussian Process Regression (GPR), deemed an accurate model for this application. The resulting model undergoes particle swarm optimization to determine the optimal aerostructure twist shape at a given wind speed with respect to the modeled performance parameter, aerodynamic thrust load. The optimization process shows an improvement of 3.15% in thrust loading for the 10 MW reference turbine, and 2.66% for the 15 MW reference turbine.

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

Portfolio optimization is a mathematical formulation whose objective is to maximize returns while minimizing risks. A lot of improvement in the model has been made, including adding practical constraints. With the growing of shares trading, the problem becomes dimensionally very large. In this paper, we propose the usage of modified Biogeography-Based Optimization to solve the large scale constrained portfolio optimization. Results indicate the effectiveness of the method used.

To curb the impacts arising from the agricultural sector the actions undertaken by policymakers, and ultimately by the farmers, are of paramount importance. However, finding the best strategy to reduce impacts, and especially assessing the effects of the interactions and mutual influence among farmers, is very difficult. To this aim, this paper shows an application of an agent-based model (ABM) coupled with life cycle assessment (LCA), which also includes multi objective optimization of farming activities (including both crop cultivation and livestock breeding) from an economic and environmental perspective. The environmental impacts are assessed using the impact assessment scores calculated with the Environmental Footprint (EF) 3.0 life cycle impact assessment (LCIA) method and the study is conducted “from cradle to farm gate”. The model is applied to all the farms in Luxembourg, whose network is constructed utilizing neighborhood interactions, through which a parameter known as farmer's green consciousness (GC) is updated at each time step. The optimization module is instantiated at the end of each time step, and decision variables (the number of livestock units and land allocation) are assigned based on profitability and specified environmental impact categories. If only profit optimization is considered (i.e. when farmers’ GC is de-activated), the results show a 9% reduction in the aggregated environmental impacts (obtained as EF “single score”) and a 5.5% increase in overall profitability. At the farm level, simulations display a clear trade-off between environmental sustainability and financial stability, with a 25% reduction in overall emissions possible if farming activities are carried using the EF single score impact in the objective function, though this results in an 8% reduction in profitability over ten years.

Hydraulic fracturing has enabled production from unconventional reservoirs in the U.S., but production rates often decline sharply, limiting recovery factors to under 10%. This study optimizes the CO2 huff-n-puff process for multistage-fractured horizontal wells in Wolfcamp A formation in the Delaware Basin. The potential for enhanced oil recovery and CO2 sequestration simultaneously was addressed using a coupled geomechanics-reservoir simulation. Geomechanical properties were derived from a 1D mechanical earth model and integrated into reservoir simulation to replicate hydraulic fracture geometries. The fracture model was validated using a robust production history matching. Fluid phase behavior analysis refined the equation of state, and 1D slim tube simulations determined a minimum miscibility pressure of 4300 psi for CO2 injection. After the primary production phase, various CO2 injection rates were tested from 1 to 25 MMSCFD/well, resulting in incremental oil recovery ranging from 6.3% to 69.3%. Different injection, soaking, and production cycles were analyzed to determine the ideal operating condition. The optimal scenario improved cumulative oil recovery by 68.8% while keeping the highest CO2 storage efficiency. The simulation approach proposed by this study provides a systematic workflow for evaluating and optimizing CO2 huff-n-puff in hydraulically fractured wells, enhancing the recovery factor of unconventional reservoirs.

With increasing constraints on energy and resource markets and the non-decreasing trend in energy demand, the need for relevant clean energy generation and storage solutions is growing and is gradually reaching the individual home. But small-scale energy storage is still an expensive investment in 2022 and the risk/reward ratio is not yet attractive enough for individual homeowners. One solution is for homeowners not to store excess clean energy individually but to produce hydrogen for mutual use. In this paper a collective production of hydrogen for a daily filling of a bus is considered. Following our previous work on the subject, the investigation consists of finding an optimal buy/sell rule to the grid, and the use of the energy with an additional objective: mobility. The dominant technique in the energy community is reinforcement learning, which is however difficult to use when the learning data is limited as in our study. We chose a less data-intensive and yet technically well-documented approach. Our results show that rulebooks, different but more interesting than the usual robust rule, exist and can be cost-effective. But they require fine-tuning as to not deteriorate system performance. In some cases, it is worth missing the H2 production requirement in exchange for higher economic performance.

Enclosed public spaces are the hotspots for airborne disease transmission. To measure and maintain indoor air quality in terms of airborne transmission, an open source, low cost and distributed array of Particulate Matter Sensors has been developed and named as Dynamic Aerosol Transport for Indoor Ventilation or DATIV system. This system can use multiple Particulate Matter Sensors (PMS) simultaneously and can be remotely controlled using a Raspberry Pie based operating system. The data acquisition system can be easily operated using the GUI within any common browser installed on a remote device such as a PC or Smartphone with corresponding IP address. The software architecture and validation measurements are presented together with possible future developments.

In this work, we explore the ability to dynamically group the Wind Turbine (WT) of a Wind Farm (WF) based on the behaviour of some of their Supervisory Control And Data Acquisition (SCADA) signals to detect the turbines that exhibit abnormal behaviour. We centre this study on a small WF of five WTs. We use the fact that the same signals from different turbines in the same WF coherently evolve temporally in a time domain, describing very similar waveforms. In this contribution, we use averaged signals from the SCADA system and omit maximums, minimums and standard deviations, focusing mainly on velocities and other slowly varying signals. For the temporal analysis, sliding windows of different temporal durations and overlapings are explored. The capability to automatically identify WTs whose signals differ from the group’s behaviour can alert and program preventive maintenance operations on such WTs before a major breakdown occurs.

In a trip planning service, travelers first set a starting point, a destination, and a sequential list of specific points of interest types (e.g., museums, restaurants, and parks). Based on this information, the service searches the spatial database to customize the best travel itinerary for the tourist. However, in previous studies, planners only considered the time factor when designing the optimal route, and failed to fully consider the quality of each point of interest. In this study, we specifically leveraged the capabilities of large language model to parse and respond to complex travel-related user queries. To apply large language model to route planning, we fine-tuned the model to understand geotagging and user travel preferences. We have introduced a novel graph search algorithm combined with large language model output, which optimizes the route search process to provide optimal travel recommendations by taking into account various factors such as distance length, budget constraints, and popularity of tourist attractions. In addition, we have integrated real-time traffic data and historical travel data to further improve the prediction accuracy and application usefulness of the model. In the experimental validation phase, we designed a series of benchmarks to compare the performance of the system with traditional algorithms and other machine learning-based route planning methods. Experimental results show that our model has a significant improvement compared with traditional methods in improving the speed and accuracy of path selection.

Addressing sustainable mobility in urban areas has become a priority in today’s society, given the growing population and increasing vehicular flow in these areas. Intelligent Transportation Systems have emerged as innovative and effective technological solutions to address these challenges. Research in this area has become crucial, as it contributes not only to improve mobility in urban areas, but also to positively impact the quality of life of its inhabitants. To address this, a dynamic clustering methodology for vehicular trajectory data is proposed which can provide an accurate representation of the traffic state. Data was collected for the city of San Francisco, a dynamic clustering algorithm was applied and then an indicator was applied to identify areas with traffic congestion. Several experiments were also conducted with different parameterizations of the forgetting factor of the clustering algorithm. The results showed in terms of precision that the dynamic clustering methodology achieved high match rates compared to the congestion indicator applied to static cells.

In today's world, news events are emerging incessantly. Classifying the same event reported by different countries is of significant importance for public opinion control and intelligence gathering. Due to the diverse types of news, relying solely on translators would be costly and inefficient, while depending solely on translation systems would incur considerable performance overheads in invoking translation interfaces and storing translated texts. To address this issue, we mainly focus on the clustering problem of cross-lingual news. To be specific, we use a combination of sentence vector representations of news headlines in a mixed semantic space and the topic probability distributions of news content to represent a news article. In the training of cross-lingual models, we employ knowledge distillation techniques to fit two semantic spaces into a mixed semantic space. We abandon traditional static clustering methods like K-Means and AGNES in favor of the incremental clustering algorithm Single-Pass, which we further modify to better suit cross-lingual news clustering scenarios. Our main contributions are as follows: (1) We adopt the English standard BERT as the teacher model and XLM-Roberta as the student model, training a cross-lingual model through knowledge distillation that can represent sentence-level bilingual texts in both Chinese and English. (2) We use the LDA topic model to represent news as a combination of cross-lingual vectors for headlines and topic probability distributions for content, introducing concepts such as topic similarity to address the cross-lingual issue in news content representation. (3) We adapt the Single-Pass clustering algorithm for the news context to make it more applicable. Our optimizations of Single-Pass include adjusting the distance algorithm between samples and clusters, adding cluster merging operations, and incorporating a news time parameter.

Perovskite solar cells (PSCs) are vital for their optical and electrical properties, with lead-based PSCs reaching a remarkable efficiency of 26.1%, while tin-based counterparts achieve 18.71%. Due to lead's toxicity, there's a push for alternatives like tin. However, tin-based PSCs suffer from stability issues and high defect density states, necessitating the development of cost-effective, high-performance, and eco-friendly alternatives. In this study, we designed a hetero-junction architecture using MASnI3-based Perovskite, opti-mized with SCAPs-1D. After exhaustive analysis, our device achieved a power conversion efficiency of 24.18%, with enhanced parameters including Voc of 0.09323V, Jsc of 30.8360 mA/cm2, and FF of 84.10%. Recombination rates, particularly Shockley-Read Hall recom-bination, were significantly reduced. Parametric analyses, encompassing absorber layer thickness, band gap, defect density, doping concentration, and operating temperature, in-dicate potential efficiency enhancements. This underscores the viability of Sn-based PSCs as a cost-effective, efficient, and environmentally benevolent alternative to lead-based counterparts, promising advancements in future research and development efforts.

Surveys on the optimum seismic design of structures reveal that many investigations focus on how to minimize its initial cost while satisfying the performance constraints. Although reducing the initial cost while complying with the requirements of earthquake design codes of practice will significantly guarantee the life safety of occupants against earthquakes, it may still cause considerable economic losses to residents and fatalities. Accordingly, calculating the possible earthquake damages caused during the structure's lifetime may become essential from the optimal Life Cycle Cost (LCC) design point of view. LCC analysis is used to evaluate economic feasibility including construction, operation, occupancy, maintenance and end-of-life costs. For optimization, the population-based, meta-heuristic algorithm based on the Ideal Gas Molecular Movement (IGMM), has established its capability in solving highly nonlinear mono and multi-objective engineering problems. Therefore, this paper investigates the LCC -based mono and multi-objective optimum design of a 3-D four-story concrete building structure combined with the Endurance Time (ET) competence. The results show that, apart from substantially reducing the total number of analyses required, the proposed technique significantly affected dipping minor injury cost, rental, and income costs by 22%, 16%, and 16%, respectively. In total, a 10% reduction in all structural life-cycle costs was achieved, which could well be considered significant.

In this paper, inspired by Jleli and Samet [journal of inequalities and applications 38 (2014) 2 1–8] we introduce two new classes of auxiliary functions and utilize the same to define (q, y)R-weak 3 contractions. Utilizing (q, y)R-weak contractions, we prove some fixed point theorems in the setting 4 of relational metric spaces. We employ some examples to substantiate the utility of our newly proved 5 results. Finally, we apply one of our newly proved results to ensure the existence and uniqueness of 6 solution of a Volterra-type integral equation.

Global optimization is widely adopted nowadays in a variety of practical and scientific problems. In this context, a group of techniques that is widely used is that of evolutionary techniques. A relatively new evolutionary technique in this direction is that of Giant Armadillo Optimization, which is based on the hunting strategy of giant armadillos. In this paper, a number of modifications to this technique are proposed, such as the periodic application of a local minimization method as well as the use of modern termination techniques based on statistical observations. The proposed modifications have been tested on a wide - series test functions, available from the relevant literature and it was compared against other evolutionary methods.

In the field of industrial process monitoring, more and more interest is being shown in specific process categories. These include time-varying processes, that is, those processes whereby the response one receives as output from the system depends on when the input signal is sent into it. There are many reasons for this process variability and such contexts are not always analyzed with this operational characteristic at their core. At the same time, interest in certain categories of techniques is also becoming more prominent, to meet certain application needs. Among these, clustering and unsupervised techniques in general are gaining ground. This is largely due to the difficulty of finding fault data with which to train, for example, supervised models. On the other hand, the clustering technique, on which this contribution focuses, also makes it possible to compensate for the lack of complete knowledge of the structure of the process itself. With these two considerations in mind, this contribution proposes a literature review on the topic of clustering applied in time-varying contexts, in the maintenance field. The aim is to present an overview of the main fields of study, the role of clustering in this context and the main clustering techniques used.

Software reliability is an important characteristic for ensuring the qualities of software products. Predicting the potential number of bugs from the beginning of a development project allows practitioners to make the appropriate decisions regarding testing activities. In the initial development phases, applying traditional software reliability growth models (SRGMs) with limited past data does not always provide reliable prediction result for decision making. To overcome this, herein we propose a new software reliability modeling method called deep cross-project software reliability growth model (DC-SRGM). DC-SRGM is a cross-project prediction method that uses features of previous projects’ data through project similarity. Specifically, the proposed method applies cluster-based project selection for training data source and modeling by a deep learning method. Experiments involving 15 real datasets from a company and 11 open source software datasets show that DC-SRGM can more precisely describe the reliability of ongoing development projects than existing traditional SRGMs and the LSTM model.

The large quantity of information retrieved from communities, public data repositories, web pages, or data mining can be sparsed and poorly classified. This work shows how to employ unsupervised classification algorithms such as K-means proper to classify user reviews into their closest category, forming a balanced data set. Moreover, we found that the text vectorization technique significantly impacts the clustering formation, comparing TF-IDF and Word2Vec. The value for mapping a cluster with movie genre was 81.34% ± 20.48 of the cases when the TF-IDF was applied, whereas Word2Vec only yielded a 53.51% ± 24.1. In addition, we highlight the impact of the removal of stop-words. Thus, we detected that pre-compiled lists are not the best method to remove stop-words before clustering because there is much ambiguity, centroids are poorly separated, and only 57% of clusters could match a movie genre. Thus, our proposed approach achieved a 94% of accuracy. After analyzing the classifiers’ results, we appreciated a similar effect when divided by the stop-words method removal. Statistically significant changes were observed, especially in precision metric and Jaccard scores in both classifiers, using custom-generated stop lists rather than pre-compiled ones. Reclassifying sparse data is strongly recommended as using custom-generated stop lists.

The question of molecular similarity is core in cheminformatics, and is usually assessed via a pairwise comparison based on vectors of properties or molecular fingerprints. We recently exploited variational autoencoders to embed 6M molecules in a chemical space, such that their (Euclidean) distance within the latent space so formed could be assessed within the framework of the entire molecular set. However, the standard objective function used did not seek to manipulate the latent space so as to cluster the molecules based on any perceived similarity. Using a set of some 160,000 molecules of biological relevance, we here bring together three modern elements of deep learning to create a novel and disentangled latent space, viz transformers, contrastive learning, and an embedded autoencoder. The effective dimensionality of the latent space was varied such that clear separation of individual types of molecules could be observed within individual dimensions of the latent space. The capacity of the network was such that many dimensions were not populated at all. As before, we assessed the utility of the representation by comparing clozapine with its near neighbours, and did the same for various antibiotics related to flucloxacillin. Transformers, especially when as here coupled with contrastive learning, effectively provide one-shot learning, and lead to a successful and disentangled representation of molecular latent spaces that at once uses the entire training set in their construction while allowing ‘similar’ molecules to cluster together in an effective and interpretable way.

Clustering is a data mining task used for the data extraction from the data bases or files. Clustering is used to find unknown groups present in the data sources like files or data bases. This paper focuses on clustering algorithms performance dependency on the parallel clustering platforms and the clustering algorithms along with their clustering criteria. The problems with the present Traditional clustering algorithms were throughput and data source size changes (scalability). So they can’t address the big data. So for handling the huge volumes of data, parallel clustering algorithms along with clustering criteria were used. For processing the big Data Parallel clustering algorithms are of two types based on computing platforms used. They were the horizontal scaling platforms and vertical scaling platforms.

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.

In recent years, the problem of ecosystem degradation caused by human activities has become increasingly serious. Vegetation restoration is a key means to solve this problem, which has increased. To address the suitability and structural optimization of vegetation restoration in the Loess Plateau, the MaxEnt model was used to quantify the impacts of environmental and human activities on the planting suitability of vegetation restoration species at the raster scale. Three layers of trees, shrubs, and herbs with 12 common vegetation restoration species were selected. The factor index system was constructed by combining climatic, ecological, and socio-economic data, and the MaxEnt model predicted land suitability. It was found that human activities significantly increased the unsuitable planting area. This especially affected Robinia pseudoacacia in the tree layer and Amorpha fruticosa in the shrub layer. Highly suitable and moderately suitable areas were mainly located in sparsely populated areas with close water sources. Through maximum suitability optimization, it was identified that the overall spatial distribution of the three layers in the study area was relatively consistent, and the structural dominance of trees + shrubs + herbs and single herbs in the vertical structure was obvious, which were concentrated in the southwestern and northeastern parts of the study area, respectively. In addition, organic content (OC) and distance from the road to woodland (RW) were the dominant factors affecting land suitability, with a contribution rate of more than 50% and up to 80%. These results provide a scientific basis for optimizing planting structures. They are of significant theoretical and practical significance in guiding vegetation restoration work.

The segmentation of urban scene mobile laser scanning (MLS) data into meaningful street objects is a great challenge due to the scene complexity of street environments, especially in the vicinity of street objects such as poles and trees. This paper proposes a three-stage method for the segmentation of urban MLS data at the object level. The original unorganized point cloud is first voxelized, and all information needed is stored in the voxels. These voxels are then classified as ground and non-ground voxels. In the second stage, the whole scene is segmented into clusters by applying a density-based clustering method based on two key parameters: local density and minimum distance. In the third stage, a merging step and a re-assignment processing step are applied to address the over-segmentation problem and noise points, respectively. We tested the effectiveness of the proposed methods on two urban MLS datasets. The overall accuracies of the segmentation results for the two test sites are 98.3% and 97%, thereby validating the effectiveness of the proposed method.

In order to achieve the dual carbon goal and simplify the decarbonization process, a CO2 recovery process of the fire-flooding exhaust was designed. The process adopted the two-stage membrane separation method to recover CO2 and obtain high purity CO2 rich flow, and then through the mixed refrigerant liquefaction and rectification column, food grade liquid CO2 was obtained. HYSYS process simulation shows that for the fire-flooding exhaust with a flow rate of 1000 kg/h and a given composition, the process can achieve a CO2 recovery of 69.02%, total product sales S=2086.8 yuan/h, and specific power consumption of 2.818 kW∙h/kg. On this basis, a hybrid simulation platform of HYSYS & Matlab was established. Taking the specific power consumption of the product as the objective function, sequential quadratic programming (SQP) algorithm was adopted to optimize the process, and the optimized specific power consumption was reduced by 18.8%. Finally, by adjusting N2/CO2 components, the adaptability of the optimization condition was analyzed.

In manufacturing chatter is an unwanted phenomenon that can lead to product quality reduction and tool wear. Real time chatter detection is key to preventing these issues and improving overall machining efficiency. In this paper we propose an unsupervised chatter detection method using autoencoders (AE) and Density-Based Spatial Clustering of Applications with Noise (DBSCAN) clustering algorithm that uses internal signals of Computer Numerical Control (CNC) machines. The proposed method starts by using an AE to extract features from raw internal signals collected from CNC machines. This step reduces the dimensionality of the data and captures the underlying patterns of chatter. Then the extracted features are fed into DBSCAN clustering algorithm which is a density based algorithm that groups similar data points and identifies outliers. We tested the proposed method with real world data collected from various CNC machines. The results show that our unsupervised chatter detection method has high accuracy, precision and recall, can detect chatter and distinguish it from normal machining. Also the method is robust to noise and can adapt to dynamic machining conditions. In summary our work presents an unsupervised chatter detection method using AE and DBSCAN clustering that uses internal signals of CNC machines. This method is a reliable and efficient solution for real time chatter detection so manufacturers can improve product quality, optimize machining process and reduce tool wear during machining.

Accurate cloud quantification is essential in climate change research. In this work, we construct an automated computer vision framework by synergistically incorporating deep neural networks and finite sector clustering to achieve robust whole sky image-based cloud classification, adaptive segmentation, and recognition under intricate illumination dynamics. A bespoke YOLOv8 architecture attains over 95% categorical precision across four archetypal cloud varieties curated from extensive annual observations (2020) at a Tibetan highland station. Tailor-made segmentation strategies adapted to distinct cloud configurations, allied with illumination-invariant image enhancement algorithms, effectively eliminate solar interference and substantially boost quantitative performance even in illumination-adverse analysis scenarios. Compared with the traditional threshold analysis method, the cloud quantification accuracy calculated within the framework of this paper is significantly improved. Collectively, the methodological innovations provide an advanced solution to markedly escalate cloud quantification precision levels imperative for climate change research, while offering a paradigm for cloud analytics transferable to various meteorological stations.

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.

Two well-known drawbacks in fuzzy clustering are the requirement of assign in advance the number of clusters and random initialization of cluster centers.; the quality of the final fuzzy clusters depends heavily on the initial choice of the number of clusters and the initialization of the clusters, then it is necessary to apply a validity index to measure the compactness and the separability of the final clusters and run the clustering algorithm several times. We propose a new fuzzy C-means algorithm in which a validity index based on the concepts of maximum fuzzy energy and minimum fuzzy entropy is applied to initialize the cluster centers and to find the optimal number of clusters and initial cluster centers in order to obtain a good clustering quality, without increasing time consumption. We test our algorithm on UCI machine learning classification datasets comparing the results with the ones obtained by using well-known validity indices and variations of FCM using optimization algorithms in the initialization phase. The comparison results show that our algorithm represents an optimal trade-off between the quality of clustering and the time consumption.

In this paper, we present the results of the research concerning extraction of informative gene expression profiles from high-dimensional array of gene expressions considering the state of patients' health using clustering method, ensemble of binary classifiers and fuzzy inference system. Applying of the proposed stepwise procedure can allow us to extract the most informative genes taking into account both the subtypes of disease or state of the patient's health for further reconstruction of gene regulatory networks based on the allocated genes and following simulation of the reconstructed models. We used the publicly available gene expressions data as the experimental ones which were obtained using DNA microarray experiments and contained two types of patients' gene expression profiles: the patients with lung cancer tumor and healthy patients. The stepwise procedure of the data processing assumes the following steps: in beginning, we reduce the number of genes by removing non-informative genes in terms of statistical criteria and Shannon entropy; then, we perform the stepwise hierarchical clustering of gene expression profiles at hierarchical levels from 1 to 10 using SOTA clustering algorithm with correlation distance metric. The quality of the obtained clustering was evaluated using complex clustering quality criterion which is considered both the gene expression profiles distribution relative to center of the clusters were these gene expression profiles are allocated and the centers of the clusters distribution. The result of this stage execution was selection of the optimal cluster at each of the hierarchical levels which corresponded to minimum value of the quality criterion. At the next step, we have implemented classification procedure of the examined objects using four well known binary classifiers: logistic regression, support-vector machine, decision trees and random forest classifier. The effectiveness of the appropriate technique was evaluated based on the use of ROC analysis using criteria included as the components the errors of both the first and the second kinds. The final decision concerning extraction of the most informative subset of gene expression profiles was taken based on the use of fuzzy inference system, the inputs of which are the results of the appropriate single classifiers operation and output is the final solution concerning state of the patient's health. To our mind, the implementation of the proposed stepwise procedure of the informative gene expression profiles extraction create the conditions for increasing effectiveness of the further procedure of gene regulatory networks reconstruction and the following simulation of the reconstructed models considering the subtypes of the disease and/or state of the patient’s health.

Major (exo)planetary and satellite bodies seem to concentrate at intermediate areas of the radial 1 distributions of all the objects orbiting in each (sub)system. We show that angular-momentum transport during secular evolution of (exo)planets and satellites necessarily results in the observed intermediate accumulation of the massive objects. We quantify the ‘middle’ as the mean of mean motions (orbital angular velocities) when three or more massive objects are involved. Radial evolution of the orbits is expected to be halted when the survivors settle near mean-motion resonances and angular-momentum transfer between them ceases (gravitational Landau damping). This dynamical behavior is opposite in direction to what has been theorized for viscous and magnetized accretion disks, in which gas spreads out and away from either side of any conceivable intermediate area. We present angular momentum transfer simulations in few-body systems, and we calculate the tidal dissipation timescales and the physical properties of the mean tidal field in planetary and satellite (sub)systems.

Risk-based redispatch optimization is proposed as a methodology to support the Transmission System Operator (TSO) with preventive remedial actions obtained by extending the security constrained unit commitment/economic dispatch with constraints resulting from the risk assessed for the power system. Although being heuristic, the methodology is based on comprehensive dynamic security assessment as time-domain simulations are used, allowing to express the degree of all types of instabilities, e.g., caused by contingencies, in monetary terms. Therefore, the risk is assessed as the expected value of the cost incurred by the TSO. Such approach forms a new pathway to including risk in planning procedures already used by TSOs. Results obtained for the IEEE39 dynamic power system, with costs assigned to load shedding and generator tripping due to single transmission lines short-circuits, are shown as a reference case.

With the engineering system becoming more and more complex, the uncertainty factors have a more and more profound influence on the reliability and security of the engineering system. In recent years, Reliability-Based Design Optimization (RBDO) has been studied extensively in complex engineering system design. The research on reliability optimization design considering stochastic uncertainty has been comprehensive and widely used. However, the reliability optimization design considering mixed uncertainty has the disadvantages of large computation and imprecise convergence. This study proposes an RBDO method based on Particle Swarm Optimization (PSO) and Simulated Annealing (SA) to overcome this challenge. In the method, PSO is used to solve the most probable point, while SA has excellent global optimization capability to acquire the global optimal solution. Finally, three examples are given to illustrate the advantages of the proposed method.

The goal of this research is to determine the optimal microwave-assisted sol-gel synthesis pa-rameters of TiO2 nanoparticles with the achievement of the crystalline TiO2 nanoparticles with the highest specific surface area and the lowest energy band gap. Titanium isopropoxide was used as a precursor to prepare the sol (colloidal solution) of TiO2, isopropanol as a solvent, acetylacetone for complexation, and nitric acid as a catalyst. Four samples of titanium dioxide were synthesized from the prepared colloidal solution in a microwave reactor at a temperature of 150 °C for 30 minutes and at a temperature of 200 °C for 10, 20, and 30 minutes. The phase composition of the prepared samples was determined by X-ray diffraction analysis (XRD) and Fourier-transform infrared spectroscopy (FTIR). Nitrogen adsorption/desorption isotherms were used to determine the spe-cific surface area and pore size distributions by Brunauer-Emmett-Teller (BET) method. The band gap energy values of the TiO2 samples were determined by diffuse reflectance spectroscopy (DRS). CrystallineTiO2 nanoparticles with the highest specific surface area and the lowest energy band gap were obtained for the TiO2 sample synthesized at 200 °C for 10 minutes.

Nonlinear nonparametric statistics (NNS) algorithm offers new tools for curve fitting. A relationship between k-means clustering and NNS regression points is explored with graphics showing a perfect fit in the limit. The goal of this paper is to demonstrate NNS as a form of unsupervised learning, and supply a proof of its limit condition. The procedural similarity NNS shares with vector quantization is also documented, along with identical outputs for NNS and a k nearest neighbours classification algorithm under a specific NNS setting. Fisher's iris data and artificial data are used. Even though a perfect fit should obviously be reserved for instances of high signal to noise ratios, NNS permits greater flexibility by offering a large spectrum of possible fits from linear to perfect.

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

Efficient quality evaluation provides support for the timely and good maintenance of the lane line marking. This paper searches and optimizes the back propagation(BP) network model which referred to the analytic hierarchy process(AHP) model structure, as well as the number of nodes in the middle layer network. Based on this, a comprehensive evaluation method of multi-dimensional lane line quality such as shape, color and contrast is established. The experimental results show that the parameters of the model are more simplified, and the scoring and classification results of lane lines are more accurate.

In recent years, Parkinson's Disease (PD) as a progressive syndrome of the nervous system has become highly prevalent worldwide. In this study, a novel hybrid technique established by integrating a Multi-layer Perceptron Neural Network (MLP) with the Biogeography-based Optimization (BBO) to classify PD based on a series of biomedical voice measurements. BBO is employed to determine the optimal MLP parameters and boost prediction accuracy. The inputs comprised of 22 biomedical voice measurements. The proposed approach detects two PD statuses: 0– disease status and 1– reasonable control status. The performance of proposed methods compared with PSO, GA, ACO and ES method. The outcomes affirm that the MLP-BBO model exhibits higher precision and suitability for PD detection. The proposed diagnosis system as a type of speech algorithm detects early Parkinson’s symptoms, and consequently, it served as a promising new robust tool with excellent PD diagnosis performance.

This work addresses the energy-based source localization problem in wireless sensors networks. Instead of circumventing the maximum likelihood (ML) problem by applying convex relaxations and approximations (like all existing approaches do), we here tackle it directly by the use of metaheuristics. To the best of our knowledge, this is the first time that metaheuristics is applied to this type of problems. More specifically an elephant herding optimization (EHO) algorithm is applied. Through extensive simulations, the key parameters of the EHO algorithm are optimized such that they match the energy decay model between two sensor nodes. A detailed analysis of the computational complexity is presented, as well as performance comparison between the proposed algorithm and existing non-metaheuristic ones. Simulation results show that the new approach significantly outperforms the existing solutions in noisy environments, encouraging further improvement and testing of metaheuristic methods.

The expansion of renewable energies is progressing strongly. The influence on the power supply networks by the volatility of the infeed must be met with new concepts. In this paper we investigate the possibilities of integrating microgrids as a cooperating unit in the power supply network to support further expansion of RES power plants. In this paper a differentiation of microgrids from similar network structures is established, a classification of proposed groups is made. Then, after the description of simulation of components in a microgrid, with practical advice, an example model is shown, which aids the dimensioning of the components within a microgrid to achieve a specified goal.

The process of testing software is examining the artifacts and behavior of the software under test by validating and verifying it. Testing can provide valuable information about the software. Given an input to the system, there is a challenge of distinguishing correct from potentially incorrect behavior, which is the test oracle problem. Although the combinatorial testing approach can effectively reduce the number of test cases, the manual inspection of the outputs is still required. In this paper, we propose an approach to automatically classify the return pages with conducting combinatorial testing based on page similarities and hierarchical clustering, by which potential output anomalies can be identified. In the experiment, we apply our approach to a real-world e-commerce website, an anomaly can be found with the visualization of the clustering hierarchy, which suggests the potential of the applicability of the approach.

Extensive growth in the volume of irregular brain cells is known as brain tumor. Human brain is surrounded by stiff skull. There are various issues that occur due to the growth of any tumor inside this restricted space. The malignant and benign are two main categories of the brain tumor. The skull is pressurized to enlarge from inside in case of growth of any benign or malignant tumor. This tumor leads to harm in brain and it may be dangerous to life also. The brain tumor is divided into two kinds - primary or secondary. The brain tumor detection techniques have various phases. In this paper, comparative study of CNN with GLCM approach and superpixel based spectral clustering is done tumor. This work takes into account metrics like accuracy, sensitivity and specificity for drawing the comparison between both the techniques.

As air traffic demand grows, robust, data-driven anomaly detection methods are required to ensure that aviation systems become safer and more efficient. The terminal airspace is identified as the most critical airspace for both individual flight-level and system-level safety and efficiency. As such, developing data-driven anomaly detection methods to analyze terminal airspace operations is paramount. With the expansion of ADS-B technology, open-source flight tracking data has become more readily available to enable larger-scale analyses of aircraft operations. This paper makes a distinction between spatial metrics in ADS-B trajectory data and energy metrics derived from ADS-B trajectory data. Motivated by the limited number of approaches that simultaneously consider both spatial and energy metrics, this paper introduces the concepts of spatial anomalies and energy anomalies. In particular, it proposes a novel, unified framework for detection of spatial and energy anomalies in ADS-B trajectory data (and associated derived metrics). The framework consists of three main parts - a data processing procedure, a spatial anomaly detection method, and an energy anomaly detection method. The framework is demonstrated utilizing four months of ADS-B trajectory data associated with arrivals at San Francisco International Airport, and the relationship between the spatial and energy anomalies in this terminal airspace is explored. The results that stem from the implementation of this framework indicate that if an aircraft is spatially not conforming to an identified set of air traffic flows representing standard spatial operations, then this aircraft is more likely to experience non-conformance to standard operations in its energy metrics. Aviation operators, such as air traffic controllers, may benefit from this observation, as it may factor into decision-making in instances where there is the potential to instruct an aircraft to spatially deviate from standard operations. Additionally, this research revealed underlying differences between trajectories that are spatially nominal yet energy-anomalous and those trajectories that are spatially anomalous and energy-anomalous. Focusing solely on energy anomaly detection does not provide insight into potential spatial-related decisions that may have been made to result in off-nominal energy behavior.

Recently Candida auris has emerged as a multi-resistant fungal pathogen, with a significant clinical impact, and has become a critical issue in WHO fungal priority list, due to its unique ability to persist for long time on human skin and hospital environments. It is therefore fundamental to reinforce hospital surveillance protocols to limit nosocomial outbreaks. The study purpose was the Fourier-Transform Infrared Spectroscopy (FT-IR) application to investigate the phylogenetic relationships between isolated strains within the C. auris outbreak at the university Intensive Care Unit of a Tertiary University hospital in Turin (Italy). In order to calculate a clustering cut-off, intra- and inter-isolates distance values were analysed. Data showed the presence of a major cluster Alfa and a minor cluster Beta with a defined C. auris clustering cut-off. The results were validated by an external C. auris strain and Principal Component and Linear Discriminant Analysis. The application of FT-IR technology had allowed to obtain important information about the phylogenetic relationships between the analysed strains, defining for the first time a “not WGS-based” clustering cut-off with a statistical-mathematical approach. FT-IR could represent a valid alternative to molecular methods for rapid and cost saving typing of C. auris strains with important clinical implications.

Chronic obstructive pulmonary disease (COPD) is a condition that significantly impacts both patients and healthcare systems. The management of COPD involves various pharmacological intervention strategies, and addressing the issue of low adherence to these strategies has become a subject of significant interest. In response to this concern, there has been a shift towards utilizing telemedicine and mobile applications. The primary objective of this scoping review is to delineate the usage of mobile applications to enhance pharmacological therapeutic adherence in adult patients with COPD. The study involved a search of databases such as Medline, Google Scholar, Cochrane, and ClinicalTrial.gov, focusing on literature published in English and Spanish over the last decade. The selected studies assessed interventions involving mobile applications (mobile apps) designed to improve pharmacological adherence. Four digital aids were identified, available on online platforms, mobile apps, or both: m-PAC, myCOPD, Wellinks mHealth, and Propeller Health. Pro-peller Health, in particular, is an app that directly measures pharmacological adherence through electronic medication monitors attached to participants' inhalers. Opening the app was associated with higher odds of using control medications compared to participants who did not open the app. The findings suggest that these digital interventions serve as valuable tools to enhance patient adherence to treatment. Future research should focus on evaluating the effectiveness of different digital devices, such as digital inhalers and mobile applications, that directly measure pharmacological adherence.

The article discusses issues related to the optimization of the operation of medium voltage networks, focusing on the optimization of network division points and the selection of the optimal network configuration aimed at reducing power and energy losses. The article provides a critical review of selected scientific works from recent years on the issue of network configuration optimization. The developed solution uses non-deterministic network models and statistical and probabilistic approaches. Optimization studies were carried out using heuristic optimization methods and proprietary algorithms for forecasting the load and power generated from renewable energy sources. The solution proposed in the article has many application possibilities. It can be used to optimize the location of network division points (reducing economic costs related to the modernization of network infrastructure) as well as to optimize the reconfiguration process in order to reduce power losses while maintaining voltage criteria.

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.

Clustering coefficient measures are key complex network analysis tools. We examine local and global clustering coefficient measures with respect to the lexicographic graph product. As a preliminary condition, we analyze the $K_3$ subgraph structure focused on vertex inclusion with respect to the product graph. From this structure, we determine both the clustering coefficient for the product graph vertices and the average clustering coefficient for the product graph.

The $k$-means problem is to compute a set of $k$ centers (points) that minimizes the sum of squared distances to a given set of $n$ points in a metric space. Arguably, the most common algorithm to solve it is $k$-means++ which is easy to implement, and provides a provably small approximation factor in time that is linear in $n$. We generalize $k$-means++ to support: (i) non-metric spaces and any pseudo-distance function. In particular, it supports M-estimators functions that handle outliers, e.g. where the distance $\mathrm{dist}(p,x)$ between a pair of points is replaced by $\min {\mathrm{dist}(p,x),1}$. (ii) $k$-means clustering with $m\geq 1$ outliers, i.e., where the $m$ farthest points from the $k$ centers are excluded from the total sum of distances. This is the first algorithm whose running time is linear in $n$ and polynomial in $k$ and $m$.

The severe climate changes due to global warming pushed the world to strive to reduce carbon emissions. This study aims to minimize the carbon emissions for a proposed smart energy hub. This paper prioritizes the minimization of carbon emissions, taking into consideration the minimization of operation running costs, and the maximization of profit. In this paper two optimization scenarios were studied, to compare the results. In the first scenario, the minimization of carbon emissions was achieved, in the second scenario, the minimization of running costs and maximization of profit from the hub assets were studied. The proposed model was designed in MATLAB. Then the results were verified by CPLEX and validated by RTDS. The multi-objective model was presented to obtain the optimal operation. The mitigation of data uncertainty was achieved by applying the Kalman filter. In this work, a novel method was proposed for the estimation of the quarter-hour resolution data from the hourly one via the Kalman filter rather than applying the classic polynomial interpolation methods.

Due to the non-degradability of petroleum-based packaging materials, serious environmental pollution and the depletion of non-renewable resources have become pressing issues. In order to actively promote green production and address these concerns, there is an urgent need for new packaging materials to replace traditional plastic products. Starch-based packaging materials, composed of starch, fiber, and plasticizers, offer a degradable and environmentally friendly alternative. Starch alone cannot undergo thermoplastic processing due to its inherent structural characteristics. Therefore, researchers have explored modifications by incorporating plasticizers to create processable thermoplastic starch (TPS). However, there are challenges related to the high crystallinity and poor compatibility between TPS and fibers, resulting in decreased mechanical properties. To address these challenges, a novel approach combining plasticizer optimization and response surface method (RSM) optimization has been proposed to enhance the mechanical properties of starch-based packaging materials. This method leverages the advantages of composite plasticizers and process parameters. The findings demonstrate that the composite plasticizer effectively disrupt the hydrogen bonding and granule morphology of starch, leading to a significant reduction in crystallinity. Based on these findings, the optimal process parameters are determined using the RSM, resulting in a forming temperature of 198 °C, forming time of 5.4 minutes, and AC content of 0.84 grams. Compared with the non-optimized values, the tensile strength increases by 12.2% and the rebound rate increases by 8.1%.

Presently power control and management play a vigorous role in information technology and power management. Instead of non-renewable power manufacturing, renewable power manufacturing is preferred by every organization for controlling resource consumption, price reduction and efficient power management. Smart grid efficiently satisfies these requirements with the integration of machine learning algorithms. Machine learning algorithms are used in a smart grid for power requirement prediction, power distribution, failure identification etc. The proposed Random Forest-based smart grid system classifies the power grid into different zones like high and low power utilization. The power zones are divided into number of sub-zones and map to random forest branches. The sub-zone and branch mapping process used to identify the quantity of power utilized and the non-utilized in a zone. The non-utilized power quantity and location of power availabilities are identified and distributed the required quantity of power to the requester in a minimal response time and price. The priority power scheduling algorithm collect request from consumer and send the request to producer based on priority. The producer analysed the requester existing power utilization quantity and availability of power for scheduling the power distribution to the requester based on priority. The proposed Random Forest based sustainability and price optimization technique in smart grid experimental results are compared to existing machine learning techniques like SVM, KNN and NB. The proposed random forest-based identification technique identifies the exact location of the power availability, which takes minimal processing time and quick responses to the requestor. Additionally, the smart meter based smart grid technique identifies the faults in short time duration than the conventional energy management technique is also proven in the experimental results.

This work aims to develop an integrated fault location and restoration approach for microgrids (MGs). This work contains two parts. Part I presents the fault location algorithm, and Part II shows the restoration algorithm. The proposed algorithms are implemented by particle swarm optimization (PSO). The fault location algorithm is based on network connection matrices, which are the modifications of bus-injection to branch-current and branch-current to bus-voltage (BCBV) matrices, to form the new system topology. The backward/forward sweep approach is used for the prefault power flow analysis. After the occurrence of fault, the voltage variation at each bus is calculated by using the Zbus modification algorithm to modify Zbus. Subsequently, the voltage error matrix is computed to search for the fault section by using PSO. After the allocation of the fault section, the multi-objective function is implemented by PSO for optimal restoration with its constraints. Finally, the IEEE 37-bus test system connected to distributed generations is utilized as the sample system for a series simulation and analysis. The outcomes demonstrated that the proposed optimal algorithm can effectively solve the fault location and restoration problem in MGs.

Image generation optimization is an important research direction in the field of deep learning, which aims to improve the performance of image generation models and the quality of generated images. In recent years, researchers have made significant progress in image generation optimization with the development of deep generative models such as generative adversarial networks (GANs) and variational autoencoders (VAEs). These models are able to generate high-quality, realistic images by learning the distribution of image data. In this study, a deep learning-based image generation optimization model was adopted, which combined the advantages of GAN and VAE. The model architecture consists of a generator and a discriminator, where the generator is responsible for generating the image and the discriminator is used to judge the authenticity of the image. In addition, the model also introduces attention mechanism and self-supervised learning strategy to further improve the quality and diversity of generated images. In the training process, a large-scale image dataset is used, and a variety of optimization algorithms are used to improve the stability and efficiency of the model. By evaluating various indicators of the generative model, including image quality, generation speed and model convergence, it was found that the introduced attention mechanism and self-supervised learning strategy significantly improved the performance of the model.

This article describes the choice of an optimization algorithm for solving problems and the optimal design of an unmanned aerial vehicle propeller. To solve the problem using evolutionary algorithms, it was transformed into an unconstrained optimization problem using a penalty function. The airfoil contours were constructed using a Bezier curve. Design variables were divided into two types: those that describe in general terms the propeller geometry or operation, such as propeller diameter, number of blades, and rev/min; and those that vary with propeller radius, such as chord length, effective airfoil angle, and airfoil geometry. The objective function is the calculation of the propeller power required to achieve a given thrust. The differential evolution algorithm was used to solve this problem.

In light of advancing technology, the conventional clock network architecture has become inadequate for addressing the intricacies inherent in modern System-on-Chip (SoC) designs. While clock mesh topology offers resilience against On-Chip Variation (OCV) fluctuations, it still necessitates manual intervention. Therefore, substantial scope exists for methodological enhancements and the refinement of rapid analytical techniques. This paper introduces a novel clock mesh synthesis approach, underpinned by dynamic programming algorithms, that guarantees latency constraints. Our experimental findings demonstrate that our algorithm achieves an additional 26.6% reduction in power consumption compared to the baseline methodology. Furthermore, it substantially reduces runtime by an average of 78.0% when contrasted with traditional simulation methods. These results highlight the potential of our methodology for enhancing the efficiency and power management of clock mesh.

Convolution forms one of the most essential operations for the FPGA-based hardware accelerator. However, the existing designs often neglect the inherent architecture of FPGA, which puts forward an austere challenge on hardware resource requirements. Even though some previous works have proposed approximate multipliers or convolution acceleration algorithms to deal with this issue, the inevitable accuracy loss and resource occupation easily lead to performance degradation. Toward this, we first propose two kinds of resource-efficient optimized accurate multipliers based on LUTs or carry chains. Then targeting FPGA-based platforms, a generic multiply-accumulate structure is constructed by directly accumulating the partial products produced by our proposed optimized radix-4 Booth multipliers without intermediate multiplication and addition results. Experimental results demonstrate that our proposed multiplier achieves a maximum 51% look-up-table (LUT) reduction compared to the Vivado area optimized multiplier IP. Furthermore, the convolutional process unit using the proposed structure achieves a 36% LUT reduction compared to existing methods. As case studies, the proposed method is applied to DCT transformer and LeNet to achieves hardware resource saving without loss of accuracy.

In the era of electrification and artificial intelligence, direct current motors are widely utilized with numerous innovative adaptive and learning methods. Traditional methods utilize model-based algebraic techniques with system identification, such as recursive least squares, extended least squares, and autoregressive moving averages. The new method known as deterministic artificial intelligence asserts physical-based process dynamics to achieve target trajectory tracking. There are two common autonomous trajectory generation algorithms: sinusoidal function and Pontryagin's based generation algorithm. This thesis aims to simulate model-following and deterministic artificial intelligence methods using sinusoidal and Pontryagin's methods and compare their performance difference when following challenging step function slew maneuver.

The collision avoidance mechanism adopted by the IEEE 802.11 standard is not optimal. The mechanism employs a binary exponential backoff (BEB) algorithm in the medium access control (MAC) layer. Such an algorithm increases the backoff interval whenever a collision is detected to minimize the probability of subsequent collisions. However, the expansion of the backoff interval causes degradation of the radio spectrum utilization (i.e., bandwidth wastage). That problem worsens when the network has to manage the channel access to a dense number of stations, leading to a dramatic decrease in network performance. Furthermore, a wrong backoff setting increases the probability of collisions such that the stations experience numerous collisions before achieving the optimal backoff value. Therefore, to mitigate bandwidth wastage and, consequently, maximize the network performance, this work proposes using reinforcement learning (RL) algorithms, namely Deep Q Learning (DQN) and Deep Deterministic Policy Gradient (DDPG), to tackle such an optimization problem. As for the simulations, the NS-3 network simulator is used along with a toolkit known as NS3-gym, which integrates a reinforcement-learning (RL) framework into NS-3. The results demonstrate that DQN and DDPG have much better performance than BEB for static and dynamic scenarios, regardless of the number of stations. Moreover, the performance difference is amplified as the number of stations increases, with DQN and DDPG showing a 27% increase in throughput with 50 stations compared to BEB. Furthermore, DQN and DDPG presented similar performances.

The main purpose of this paper is to propose a novel optimization model with a new machine learning approach in the first section to achieve the best results in financial institutions in the second section. Since the constancy of efficacy derived from parametric and non-parametric is not significant, this paper provides a scientific assessment at the optimization section and proposes a novel combined parametric and non-parametric model which will be a new experiment in literature perception. A scientific assessment of banks based on a combination of the efficiency measurement method of CCR(Charnes, Cooper and Rhodes model) or CRS(Constant Return to Scale) BCC(Banker, Charnes, and Cooper model) or VRS (Variable Return to Scale) in Data Envelopment Analysis (DEA), as well as Stochastic Frontier Approach (SFA) for 65 banks during Feb to July 2020, are introduced. For analyzing the performance of the parametric and non-parametric approaches we have considered the linear regression and Unreplicated Linear Functional Relationship (ULFR). At the machine learning section, a novel four-layers data mining filtering pre-processes for selected supervised classification as well as unsupervised clustering algorithms to increase the accuracy and to remove unrelated attributes and data are applied. For the four kinds of preprocessing approaches of unsupervised attributes, supervised attributes, supervised instances, and unsupervised instances, we have chosen discretization, attribute selection, stratified remove folds, and resample filters respectively. Based on the nature of the suggested financial institution's dataset and attributes, the most appropriate preprocessing filter in each layer to achieve the highest performance is suggested. Finally, the superior bank, best performance model, and the most accurate algorithm are introduced. The results indicate that the bank number 56 is the superior bank. Among the proposed techniques, the novel recommended CVS compared with CCR-BCC and SFA models, has a more positive correlation with profit risk, and show a higher coefficient of determination values. Sequential Minimal Optimization(SMO) algorithm receives the highest accuracy in all four suggested filtering layers.

The notion of enhancement of the image is to ameliorate the perceptibility of information contained in an image. In the present research, a novel technique for the enhancement of image quality is propounded using fuzzy logic technique with a cuckoo optimization algorithm. Generally, the image is transformed from RGB domain to HSV domain keeping the color information intact within the image. The image has been categorized into three regions: underexposed, overexposed and mixed region on the basis of two threshold values. For the fuzzification of under and overexposed area the degree of membership is defined by the Gaussian membership, while the mixed area is fuzzified by parametric sigmoid function. The key parameters like visual factors and fuzzy contrast provide the quantitative analysis of an image. An objective function is framed which involves entropy and visual factor has been optimized by a new evolutionary cuckoo optimization algorithm. The results procured after simulation by the cuckoo optimization algorithm are compared with Bacterial foraging algorithm and ant colony optimization based image enhancement and this approach is found to be improved.

Mathematical optimization offers a valuable approach to tackle Industry scheduling problems. By formulating the scheduling challenge as a mathematical problem, mathematical optimization enables efficient and effective decision-making processes. Mathematical optimization is particularly beneficial in complex scheduling scenarios, such as in networked manufacturing environments, where multiple jobs and resources need to be coordinated. By leveraging optimization models and algorithms, it becomes possible to generate optimal process plans, considering factors like job dependencies, resource availability, and timing constraints. Through mathematical optimization, organizations can achieve improved efficiency, reduced lead times, and enhanced utilization of resources. Rigorous mathematical formulations and optimization techniques enables to surpass traditional manual planning methods and brings forth powerful computational capabilities. By optimizing various scheduling objectives, from minimizing makespan to maximizing resource utilization, mathematical optimization provides organizations with valuable insights and actionable plans. The purpose of this study is to discuss scheduling solutions for multiple jobs in a networked manufacturing setting based on mathematical optimization process. The study analyses a solver-based approach to generate the optimal process plans for multiple jobs and compare it with a more traditional game-theoretic approach. The objectives aim to develop two solver-based model using Z3 and Gurobi to generate optimal process plans; implement a game-theoretic model to solve for the same set of scheduling problems, and compare the computational time, solution quality, and efficiency of both approaches. To achieve this, the methodology will start with the problem definition. Multiple jobs are to be scheduled on a set of parallel machines. Each job has predefined processing times, deadlines, and priorities. The objective is to minimize the total completion time and maximize machine utilization while meeting all deadlines.

In this paper, a multi-patch weakly singular isogeometric boundary element method (WSIGABEM) for two-dimensional elastostatics is proposed. Since the method based on the weakly singular boundary integral equation, the quadrature techniques, dedicated for the weakly singular and regular integrals, are applied in the method. A new formula for the generation of collocation points is suggested to take the full advantage of the multi-patch technique. The generated collo-cation points are essentially inside the patches without any correction. If the boundary conditions are assumed to be continuous in every patch, no collocation point lies on the discontinuous boundaries, thus simplifying the implementation. The multi-patch WSIGABEM is verified by the simple examples with analytical solutions. The feature of the present multi-patch WSIGABEM is investigated by the comparison with the traditional IGABEM. Furthermore, the combination of the present multi-patch WSIGABEM and the particle swarm optimization algorithm results in a shape optimization method in two-dimensional elastostatics. By changing some specific control points and their weights, the shape optimizations of the fillet corner, the spanner and the arch bridge are verified to be effective.

In the modern days the data is coming from various devices like mobiles, tabs, laptops, computers, IOT devices e.tc and is stored in the electronics form in the systems using the concept of files or data bases. Clustering Technique is used to extract data from these sources. Improving the accuracy of the model is improved using the feature selection or feature engineering or both. The feature engineering is used to add a new feature based on the global mean. Along with that new feature in addition to the feature selection increase the overall accuracy of the model.

Hox gene clusters are crucial in Embryogenesis. It was observed that some Hox genes are located in order along the telomeric to centromeric direction of the DNA sequence: Hox1, Hox2, Hox3…. These genes are expressed in the same order in the ontogenetic units of the Drosophila embryo along the Anterior-Posterior axis. The two entities (genome and embryo) differ significantly in linear size and in-between distance. This strange phenomenon was named Spatial Collinearity (SP). Later, it was observed that, particularly in the Vertebrates, a Temporal Collinearity (TC) coexists: first is Hox1 expressed, later Hox2 and even later Hox3,…,. According to a Biophysical Model (BM), pulling forces act at the anterior end of the cluster while a cluster fastening applies at the posterior end. Hox clusters are irreversibly elongated along the force direction. During Evolution, the elongated Hox clusters are broken at variable lengths thus split clusters may be created. An Empirical Rule was formulated distinguishing development due to a complete Hox cluster from development due to split Hox clusters. BM can ‘explain’ this Empirical Rule. In a spontaneous mutation where the cluster fastening is dismantled, a weak pulling force automatically shifts the cluster inside the Hox activation domain. This cluster translocation can probably explain the absence of Temporal Collinearity in Drosophila.

Some optimal control problems need metaheuristics in searching for the optimal solution, especially when the process has certain characteristics like the Photobioreactor for Algae Growth (distributed parameter, nonlinearities, etc.). Particle Swarm Optimization (PSO) algorithms within control structures are a realistic approach; their task is often to predict the optimal control values working with a process model (PM). Owing to numerous numerical integrations, there is a big computational effort that is reflected in a large controller execution time. The authors propose to replace the PSO predictor with a machine learning model that has “learned” the quasi-optimal behavior of the couple (PSO, PM); the training data is obtained through closed-loop simulations over the control horizon. The new controller should preserve the process’s quasi-optimal control. In identical conditions, the process evolutions must also be quasi-optimal. The multiple Linear Regression and the Regression Neural Networks were considered as predicting models. The paper first proposes algorithms for collecting and aggregating data sets for the learning process. Algorithms for constructing the machine learning models, implementing the controllers, and closed-loop simulations are also proposed. The simulations prove that the two machine learning predictors have learned the PSO predictor’s behavior such that the process evolves almost identically. The resulting controllers’ execution time drastically decreased while keeping their optimality.