Glioma accounts for the highest proportion of primary intracranial malignant tumors. Microenvironment enormously influences the process of glioma progression. Our study is to establish an individualized prognostic nomogram for glioma patients with microenvironment signature. Glioma samples of Chinese Glioma Genome Atlas (CGGA) were grouped by the immune and stromal score based on ESTIMATE algorithm. Microenvironment-related genes (MRGs) in glioma were analyzed by R. To determine the best prognostic correlation genes, univariate and multivariate Cox regression analysis were used to analyze MRGs. Use the selected genes (CHI3L1, SOCS3, SLC47A2, COL3A1, SRPX2 and SERPINA3), we established the prognostic risk score model (microenvironment signature) and validated it. Gene Set Enrichment Analysis (GSEA) showed that the high-risk group was mainly enriched in immune and stromal function KEGG pathways. Finally, the nomogram was constructed and evaluated. The receiver operating characteristic (ROC) curve, Calibration plots and decision curve analysis (DCA) of training and validation set indicated the excellent predictive performance of nomogram. In conclusion, the 6-gene microenvironment signature can not only provide directions for the basic research of glioma, but also can be included as an independent prognostic index in nomogram for individual prediction to guide clinical treatment.

Maize (Zea mays subsp. mays) is the staple food crop in the world. In this study, multi-layer perceptron (MLP), support vector machine (SVM), genetic algorithm-based multi-layer perceptron (MLP-GA), and genetic algorithm-based support vector machine (SVM-GA) hybrid artificial intelligence algorithms were used for the prediction of drought tolerance and stress tolerance indices in teosinte maize lines. Correspondingly, the gamma test technique was applied to determine efficient input and output vectors. The potential of developed models was evaluated based on statistical indices and graphical representation. Results of gamma test based on the least value of gamma and standard error indices show that day of anthesis (DOA), day of silking (DOS), yield index (YI), and gross yield per plant (GYP) information vector arrangements were determined as efficient information vector combination for drought-tolerant index (DTI) as well as the stress-tolerant index (STI). The results of MLP, SVM, MLP-GA, and SVM-GA algorithms were compared based on statistical indices and visual interpretation that have satisfactory for prediction of the drought-tolerant index and stress-tolerant index in maize crop. It has also seemed that genetic algorithm-based hybrid models (MLP-GA and SVM-GA) were found a better prediction of the drought-tolerant index and stress-tolerant index in maize crop. Similarly, the SVM-GA model has the highest potential to forecast the DTI and STI in maize crops as compared to MLP, SVM, MLP-GA models.

Enhancing underwater images in epicontinental sea is a challenging problem owing to the influence of ocean currents, the refraction, absorption and scattering of light by suspended particles, and the weak illumination intensity. Recently, different methods have relied on the underwater image formation model and deep learning techniques to restore the underwater image, but they tend to degrade underwater image, interference of background clutter and miss boundary details of blue regions. Improved image fusion and enhancement algorithm based on a priori dark channel is proposed in this paper. Image edge features sharpening and dark detail enhancement by homomorphism filtering in CIELab color space is realized. In RGB color space, the multi-scale retinal with color restoration (MSRCR) algorithm is used to improve color deviation and enhance color saturation, and the contrast-limited adaptive histogram equalization (CLAHE) algorithm is used to de fog and enhance image contrast. Finally, according to the dark channel images of the three processing results, the final enhanced image is obtained by linear fusion of multiple images and multiple channels. Experimental results demonstrate the effectiveness and practicality of the proposed method on various datasets.

In this paper, we proposed a high accurate and stable Legendre transform algorithm which can reduce the potential instability for very high order at a very small increase in the computational time. The error analysis of interpolative decomposition for Legendre transform is presented. By employing block partitioning of Legendre-Vandermonde matrix and butterfly algorithm, a new Legendre transform algorithm with computational complexity O(N(logN)^2/loglogN) in theory and less than O(N(logN)^4) in practical application is obtained. Numerical results are provided to demonstrate the efficiency and numerical stability of the new algorithm.

In automated manufacturing systems, most of the manufacturing processes including machining are automated. Automatic tool change is one of the important parameters for reducing manufacturing lead time. Ceramic cutting tools are used to machine hard materials. Ti[C,N] mixed alumina ceramic cutting tools are widely used to machine hardened steel and Stainless Steel due to its superior mechanical properties. Martensitic stainless steel has wide applications in screws, bolts, nuts and other engineering applications. Machining studies on Martensitic Stainless Steel was conducted using Ti[C,N] mixed alumina ceramic cutting tool. Tool life was evaluated using flank wear criterion. The tool life obtained from experimental machining process was taken as training dataset and test dataset for machine learning. Using the dataset obtained from experimental machining tool life model has been developed using Gradient Descent algorithm. The model was validated using co-efficient of determination. The accuracy of the machine learning model was tested using the test data and 99.83% accuracy was obtained. Tool life model based on Gradient Descent Algorithm was successfully implemented for the tool life of Ti[C,N] mixed alumina ceramic cutting tool.Keywords: keyword 1; keyword 2; keyword 3 (List three to ten pertinent keywords specific to the article; yet reasonably common within the subject discipline.)

The Vehicle Routing Problem (VRP) and its variants are found in many fields, especially logistics. In this study, we introduced an adaptive method to a complex VRP. It combines multi-objective optimization and several forms of VRPs with practical requirements for an urban shipment system. The optimizer needs to consider terrain and traffic conditions. The proposed model also considers customers' expectations, shipper considerations as goals, and the common goal like transportation cost. We offered compromise programming to approach the multi-objective problem by decomposing the original multi-objective problem into a minimized distance-based problem. We designed a hybrid version of the Genetic algorithm with the Local Search algorithm to solve the proposed problem. We evaluate the effectiveness of the proposed algorithm with the Tabu Search algorithm, the original Genetic algorithm on the tested dataset. The results show that our method is an effective decision-making tool for the multi-objective VRP and an effective solver for the new variation of VRP.

This work is mainly focused on improving the differential evolution algorithm with the utilization of shadowed and general type 2 fuzzy systems to dynamically adapt one of the parameters of the evolutionary method. In this case, the mutation parameter is dynamically moved during the evolution process by using a shadowed and general type-2 fuzzy systems. The main idea of this work is to make a performance comparison between using shadowed and general type 2 fuzzy systems as controllers of the mutation parameter in differential evolution. The performance is compared with the problem of optimizing fuzzy controllers for a D.C. Motor. Simulation results show that general type-2 fuzzy systems are better when higher levels of noise are considered in the controller.

A theoretical model to translate the evolution over time, in early stages, of growth and accumulation of biofilm bacterial mass is introduced. The model implies the solution of a system of differential-difference master equations. The application of an algorithm like Miller´s tree term recurrence, already known for Bessel functions of first kind, allows an exact calculation of the solutions of such equations, for a wide range of parameters values and time. For biofilm model a five term recurrence is deduced and applied in a backwards computation. A suitable normalisation condition completes the reach of the solution.

The agricultural sector in Palestine has a significant role in its economy. However, the production of this sector is affected by different kinds of plant diseases, specifically leaf diseases. Automatic agricultural leaf disease detection is essential for the early diagnosis and controls the overall health of fields. Image segmentation techniques, clustering, and deep learning are often used to detect diseased leaves. This study proposes a novel hybrid approach based on image classification. The hybrid approach combines the k-means clustering algorithm with Convolutional Neural Network (CNN), where k-means is used to detect the leaf’s infected area, then CNN is used for specifying the disease. We used the PlantVillage dataset for experimental verification as it contains several crops with different kinds of challenging diseases. We also examined the selection of optimal k-value using the Silhouette coefficient, Elbow method, and Kneedle Algorithm. The Silhouette technique was analyzed using three distance metrics; Euclidean, Manhattan, and Cosine. Its scores for the three-distance metrics were low, near-zero, and failed to produce the optimum k value. Besides, the Elbow method was complicated to use in image segmentation in terms of executing and visualizing the k value in its graph plot. Based on verification results, the Kneedle Algorithm produced better results in the consistency of choosing the optimal k value and showed superiority over other approaches. Therefore, the processed images were segmented with the k-means clustering algorithm with a Kneedle algorithm-based k value. Finally, a Convolutional Neural Network (CNN) is trained to classify the type of disease based on analyzing and testing leaf images. The hybrid model achieved high accuracy of 93.79% in disease identification, confirming the proposed model’s robustness.

Dyadic data which is also called co-occurrence data (COD) contains co-occurrences of objects. Searching for statistical models to represent dyadic data is necessary. Fortunately, finite mixture model is a solid statistical model to learn and make inference on dyadic data because mixture model is built smoothly and reliably by expectation maximization (EM) algorithm which is suitable to inherent spareness of dyadic data. This research summarizes mixture models for dyadic data. When each co-occurrence in dyadic data is associated with a value, there are many unaccomplished values because a lot of co-occurrences are inexistent. In this research, these unaccomplished values are estimated as mean (expectation) of random variable given partial probabilistic distributions inside dyadic mixture model.

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

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.

We present a novel method for interpolating univariate time series data. The proposed method combines multi-point fractional Brownian bridges, a genetic algorithm, and Takens’ theorem for reconstructing a phase space from univariate time series data. The basic idea is to first generate a population of different stochastically interpolated time series data, and secondly, to use a genetic algorithm to find the pieces in the population which generate the smoothest reconstructed phase space trajectory. A smooth trajectory curve is hereby found to have a low variance of second derivatives along the curve. For simplicity, we refer to the developed method as PhaSpaSto-interpolation, which is an abbreviation for phase-space-trajectory-smoothing stochastic interpolation. The proposed approach is tested and validated with a univariate time series of the Lorenz system, five non-model data sets and tested against a cubic spline interpolation and a linear linear interpolation. We find that the criterion for smoothness guarantees low errors on known model and non-model data. Finally, we interpolate the discussed non-model data sets, and show the corresponding improved phase space portraits. The proposed method is useful for interpolating low-sampled time series data sets for, e.g., machine learning, regression analysis, or time series prediction approaches.

The traditional sequent peak algorithm (SPA) was used to assess the reservoir volume (VR) for comparison with deficit volume, DT, (subscript T representing the return period) obtained from the drought magnitude (DM) based method with draft level set at the mean annual flow on 15 rivers across Canada. At an annual scale, the SPA based estimates were found to be larger with an average of nearly 70% compared to DM based estimates. To ramp up DM based estimates to be in parity with SPA based values, the analysis was carried out through the counting and the analytical procedures involving only the annual SHI (standardized hydrological index, i.e. standardized values of annual flows) sequences. It was found that MA2 or MA3 (moving average of 2 or 3 consecutive values) of SHI sequences were required to match the counted values of DT to VR. Further, the inclusion of mean, as well as the variance of the drought intensity in the analytical procedure, with aforesaid smoothing led DT comparable to VR. The distinctive point in the DM based method is that no assumption is necessary such as the reservoir being full at the beginning of the analysis - as is the case with SPA.

We consider the problem of scheduling $n$ jobs with identical processing times and given release as well as delivery times on $m$ uniform machines. The goal is to minimize the makespan, i.e., the maximum full completion time of any job. This problem is well-known to have an open complexity status even if the number of jobs is fixed. We present a polynomial-time algorithm for the problem which is based on the earlier introduced algorithmic framework blesscmore (``branch less and cut more''). We extend the analysis of the so-called behavior alternatives developed earlier for the version of the problem with identical parallel machines and show how the earlier used technique for identical machines can be extended to the uniform machine environment if a special condition on the job parameters is imposed. The time complexity of the proposed algorithm is $O(\gamma m^2 n\log n)$, where $\gamma$ can be either $n$ or the maximum job delivery time $q_{\max}$. This complexity can even be reduced further by using a smaller number $\kappa<n$ in the estimation describing the number of jobs of particular types. However, this number $\kappa$ becomes only known when the algorithm has terminated.

This paper presents a theorem in factorial functions with the sum of any two nonnegative integers that is equal to multiple of the product of factorial of the same two nonnegative integers.

Cyber-physical security is vital for protecting key computing infrastructure against cyber attacks. Individuals, corporations, and society can all suffer considerable digital asset losses due to cyber attacks, including Data loss, theft, financial loss, reputation harm, company interruption, infrastructure damage, ransomware attacks, and espionage. A cyber-physical attack harms both digital and physical assets. Cyber-physical system security is more challenging than software-level cyber security because it requires physical inspection and monitoring. This paper proposes an innovative and effective algorithm to strengthen Cyber-Physical Security (CPS) with minimal human intervention. It is a Human Activity Recognition (HAR)-based approach where a GoogleNet-BiLSTM network hybridization has been used to recognize suspicious activities in cyber-physical infrastructure perimeter. The proposed HAR-CPS algorithm classifies suspicious activities from real-time video surveillance with an average accuracy of 73.15%. It incorporates Machine Vision at the IoT Edge (Mez) technology to make the system latency tolerant. Dual-layer security has been ensured by operating the proposed algorithm and GoogleNet-BiLSTM hybrid network from a cloud server, which ensures the security of the proposed security system. The innovative optimization scheme makes it possible to strengthen cyber-physical security with $4.29 per month only.

Abstract: Imaging devices of less than 300,000 pixels are mostly used for sewage conduit exploration due to the petty nature of the survey industry in Korea. P articular ly , devices of less than 100,000 pixels are still widely used, and the environment for image processing is very bitter . Since the sewage conduit image s covered in this study ha ve a very low resolution (240 × 320 = 76,800 pixels), it is very difficult to detect cracks. Because most of the resolution of the sewe r conduit images are very low in Korea, this problem of low resolution was selected as the subject of study. Cracks were detected through a total of six steps of improving the crack in Step 2, finding the optimal threshold value in Step 3, and applying an algorithm to detect cracks in Step 5. Cracks were effectively detected by the optimal parameters in Steps 2 and 3 and the user algorithm in Step 5. Desp ite the very low resolution, the cracked image s showed 96.4% accuracy of detection, and the non cracked image s showed 94.5% accuracy . Moreover, the analysis was excellent in quality , also . It is believed that the findings of this study can be effectively u sed for crack detection with low resolution images.

A refractive lens is one of the simplest, cost-effective and easily available imaging elements. With a spatially incoherent illumination, a refractive lens can faithfully map every object point to an image point in the sensor plane, when the object and image distances satisfy the imaging conditions. However, static imaging is limited to the depth of focus, beyond which the point-to-point mapping can be only obtained by changing either the location of the lens or the imaging sensor. In this study, the depth of focus of a refractive lens in static mode has been expanded using a recently developed computational reconstruction method, Lucy-Richardson-Rosen algorithm (LRRA). The technique consists of three steps. In this first step, the point spread functions (PSFs) were recorded along different depths and stored in the computer as PSF library. In the next step, the object intensity distribution was recorded. The LRRA was then applied to deconvolve the object information from the recorded intensity distributions in the final step. The results of LRRA were compared against two well-known reconstruction methods namely Lucy-Richardson algorithm and non-linear reconstruction.

The problem of scheduling is an area that has attracted a lot of attention from researchers for many years. Its goal is to optimize resources in the system. The assigning task to the lecturer is an example of the timetabling problem, a class of scheduling. This study introduces a mathematical model to assign fixed tasks (the time and required skills to be fixed) to university lecturers. Our model is capable of generating a calendar that maximizes faculty expectations. The formulated problem is in the form of a multi-objective problem that optimal makes decisions require the trade-off presence of trade-offs between two or more conflicting objectives. To solve this, we use the Compromise Programming approach to multi-objective programming. We then proposed the new version of the Genetic Algorithm to solve the introduced model. Finally, the model and algorithm tested with real scheduling data collected at the Computing Fundamental Department, FPT University, Hanoi, Vietnam.

Direct imaging systems that create an image of an object directly on the sensor in a single step are prone to many constraints as a perfect image is required to be recorded within this step. In designing high resolution direct imaging systems with a diffractive lens, the outermost zone width either reaches the lithography limit or the diffraction limit itself imposing challenges in fabrication. However, if the imaging mode is switched to an indirect one consisting of multiple steps to complete imaging, then different possibilities open up. One such methods is the widely used indirect imaging method with Golay configuration telescopes. In this study, a Golay-like configuration has been adapted to realize a large area diffractive lens with three sub-aperture diffractive lenses. The sub-aperture diffractive lenses are not required to collect light and focus them to a single point as in a direct imaging system but to focus independently on different points within the sensor area. This approach of Large Area Diffractive lens with Integrated Sub-Apertures (LADISA) relaxes the fabrication constraints and allows the sub-aperture diffractive elements to have a larger outermost zone width and smaller area. The diffractive sub-apertures were manufactured using photolithography. The fabricated diffractive element has been implemented in indirect imaging mode using non-linear reconstruction and Lucy-Richardson-Rosen algorithm with synthesized point spread functions. The computational optical experiments revealed an improved optical and computational imaging resolutions compared to previous studies.

Background: Administrative healthcare databases are widespread and are often standardized with regard to their content and data coding, thus they can be used also as data sources for surveillance and epidemiological research. Chronic dialysis requires patients to frequently access hospital and clinic services, causing a heavy burden to healthcare providers. This also means that these patients are routinely tracked on administrative databases, yet very few case definitions for their identification are currently available. The aim of this study was to develop two algorithms derived from administrative data for identifying incident chronic dialysis patients and test their validity compared to the reference standard of the regional dialysis registry. Methods: The algorithms are based on data retrieved from hospital discharge records (HDR) and ambulatory specialty visits (ASV) to identify incident chronic dialysis patients in an Italian region. Subjects are included if they have at least one event in the HDR or ASV databases based on the ICD9-CM dialysis-related diagnosis or procedure codes in the study period. Exclusion criteria comprise non-residents, prevalent cases, or patients undergoing temporary dialysis, and are evaluated only on ASV data by the first algorithm, on both ASV and HDR data by the second algorithm. We validated the algorithms against the Emilia-Romagna regional dialysis registry by searching for incident patients in 2014. Results: Algorithm 1 identified 680 patients and algorithm 2 identified 676 initiating dialysis in 2014, compared to 625 patients included in the regional dialysis registry. Sensitivity for the two algorithms was respectively 90.8% and 88.4%, positive predictive value 84.0% and 82.0%, and percentage agreement was 77.4% and 74.1%. Conclusions: These results suggest that administrative data have high sensitivity and positive predictive value for the identification of incident chronic dialysis patients. Algorithm 1, which showed the higher accuracy and has a simpler case definition, can be used in place of regional dialysis registries when they are not present or sufficiently developed in a region, or to improve the accuracy and timeliness of existing registries.

In the rescue operations the full time of action plays important role. It is a sum of planning, travel, and manipulation (in the action place) phases times. The time minimization of first two phases by autonomous vehicle for remote action is considered in the paper. For known a priori map the path planning consists of local optimal decision collected next in the general algorithm of the optimal path. Such approach significantly reduces time of path planning. The robot features and known sparse obstacles reduce the allowable robot speeds. The time of travel is calculated from allowable velocity profile. So, it can be used to estimate the travel performance. Genetic algorithm and random search-based methods for path finding with travel time optimization are exploited and compared in the paper. All the proposed time optimisation solutions of rescue operation are checked during computer simulations and results of simulation are presented.

Distributed electric propulsion technology has great potential and advantage in the development of drones. In this paper, to study the slipstream effect of distributed propeller, the actuator disk method was used to verify a single propeller, and the calculated thrust was in good agreement with the test results. Then, based on the actuator disk method, the influence of different installation positions on the slipstream effect was studied, and the distributed propeller layout was optimized by genetic algorithm. The analysis results showed that lift of the wing will be larger when the propellers are higher than the wing. When the relative height between the propeller and the wing is zero, the drag is the lowest. The influence of disk diameter on the slipstream is that the larger the diameter is, the higher the lift force and the drag force are. The slipstream effect of the optimized propeller distribution improves the lift-drag ratio of the wing, by 108.5% in the initial lift-drag ratio.

Due to advancement in hacking/reverse engineering tools, threat against transfer of sensitive data or highly classified information is always at risk of being intercepted by an attacker. Covert communication outwit this malicious breach of privacy act better than cryptography as it camouflage secret information inside another innocent looking information, while cryptography shows scrambled information that might arouse attention of an attacker. However, the challenges in Steganography are the modification of carrier that causes some abnormalities, which is detectable and often the methods are not optimize. This paper presents an approach in Covert communication Chanel, which utilizes mathematical concept of combination to optimize time of transmission using sets of multiple transmitter’s, and receiver’s addresses where each abstractly represents a set of bits or characters combination without modifying the address. To minimize the number of physical address to be use, a combinatorial and permutation concept of virtual address generation from physical address is introduce. The paper in addition presents some technique like relationship and their application in both re-enforcing resistivity against Steganalysis and generating combinations. Furthermore, a concept of dynamical clockwise and anti-clockwise rotation of combination over addresses after every transmission is introduce to further improve on resistivity against Steganalysis. A simple test was performed for demonstrating relay address, combination and permutation concepts. Based on test results and analysis, the method is effective as expected and it is quite easy to use as it can be implemented in different platform without much difficulties.

Background: Risk tratification based on pre-test probability may improve the diagnostic accuracy of temporal artery high-resolution compression sonography (hrTCS) in the diagnostic workup of cranial giant cell arteriitis (cGCA). Methods: A logistic regression model with candidate items was derived from a cohort of patients with suspected cGCA (n = 87). The diagnostic accuracy of the model was tested in the derivation cohort and in an independent validation cohort (n = 114) by receiver operator characteristics (ROC)-analysis. The clinical items were composed to a clinical prediction rule, integrated into a stepwise diagnostic algorithm together with CRP-values and hrTCS-values. Results: The model consisted of 4 clinical variables (age &gt; 70, headache, jaw claudication, anterior ischemic optic neuropathy). The diagnostic accuracy of the model for discrimination of patients with and without a final clinical diagnosis of cGCA was excellent in both cohorts (AUC 0.96 and AUC 0.92, respectively). The diagnostic algorithm improved the positive predictive value of hrCTS substantially. Within the algorithm, 32.8% of patients (derivation cohort) and 49.1% (validation cohort) would not have been tested by hrtCS. None of these patients had a final diagnosis of cGCA. Conclusion: A diagnostic algorithm based on a clinical prediction rule improves the diagnostic accuracy of hrTCS.

he paper presents an innovative method for tourist route planning inside a destination. The necessity of reorganizing the tourist routes within a destination comes as an immediate response to the Covid-19 crisis. The implementation of the method inside tourist destinations can bring an important advantage in transforming a destination into a safer destination in times of Covid-19 and post-Covid-19. The existing trend of shortening the tourist stay length has been accelerated while the epidemic became a pandemic. Moreover, the wariness for future pandemics has brought into spotlight the issue of overcrowded attractions inside a destination at certain moments. The method presented in this paper proposes a backtracking algorithm, more precisely an adaptation of the travelling salesman problem. The method presented is aimed to facilitate the navigation inside a destination and to revive certain less-visited sightseeing spots inside a destination while facilitating conformation with the social distancing measures imposed for Covid-19 control.

Distracted driving is the leading cause of accidents, the cause of these distractions may include drowsiness, using cell phone, smoking a cigarette, etc. The proposed paper aims at monitoring the attentiveness of the driver and alerting the driver when his/her alertness goes below a certain threshold. It uses image processing using OpenCV (Computer Vision) and You Look Only Once (YOLO) algorithm to detect the eyes and object respectively and sounds an alarm when the driver is either drowsy or using his cell phone or smoking a cigarette.

Ultrasound based haptic feedback is a potential technology for human-computer interaction (HCI) with the advantages of low cost, low power consumption and controlled force. In this paper, the phase optimization for multipoint haptic feedback based on ultrasound array is investigated and the corresponding experimental verification is provided. A mathematical model of acoustic pressure is established for the ultrasound array and then a phase optimization model for an ultrasound transducer is constructed. We propose a pseudo-inverse (PINV) algorithm to accurately determine the phase contribution of each transducer in the ultrasound array. By controlling the phase difference of the ultrasound array, the multipoint focusing forces are formed leading to various shapes such as geometries and letters that can be visualized. Because the unconstrained PINV solution results in unequal amplitudes for each transducer, a weighted amplitude iterative optimization is deployed to further optimize the phase solution, by which the uniform amplitude distributions of each transducer are obtained. For the purpose of experimental verifications, a platform of ultrasound haptic feedback consisting of a Field Programmable Gate Array (FPGA), an electrical circuit and an ultrasound transducer array is prototyped. The haptic performances of single point, multiple points and dynamic trajectory were verified by controlling the ultrasound force exerted on the liquid surface. The experimental results demonstrate that the proposed phase optimization model and theoretical results are effective and feasible, and the acoustic pressure distribution is consistent with the simulation results.

Stray light is a critical aspect for high performance optical instruments. When stray light control by design is insufficient to reach the performance requirement, correction by post-processing must be considered. This situation is encountered for example in the case of the Earth observation in-strument 3MI, whose stray light properties are complex due to the presence of many ghosts dis-tributed on the detector array. We implement an iterative correction method and discuss its con-vergence properties. Spatial and field binning can be employed to reduce the computation time but at the cost of a decreased performance. Interpolation of the stray light properties is required to achieve high performance correction. For that, two methods are proposed and tested. The first interpolate the stray light in the field domain while the second applies a scaling operation based on a local symmetry assumption. Ultimately, the scaling method is selected and a stray light reduction by a factor of 58 is obtained at 2σ (129 at 1σ) for an extended scene illumination.

While Spinal Cord Stimulation (SCS) provides satisfaction to almost 2/3 of Persistent Spinal Pain Syndrome-Type 2 (PSPS-T2) patients implanted for refractory chronic back and/or leg pain when not adequately addressed the back pain component, leaves patients in a therapeutic cul-de-sac. Peripheral Nerve field Stimulation (PNfS) has shown interesting results addressing back pain in the same population. Far from placing these two techniques in opposition, we suggest that these approaches could be combined to better treat PSPS-T2 patients. We designed a RCT (CUMPNS), with a 12-month follow-up, to assess the potential added value of PNfS, as a salvage therapy, in PSPS-T2 patients experiencing a “Failed SCS Syndrome” in the back pain component. Fourteen patients were included in this study and randomized into 2 groups (“SCS + PNfS” group/n=6 vs “SCS only” group/n=8). The primary objective of the study was to compare the percentage of back pain surface decrease after 3 months, using a computerized interface to obtain quantitative pain mappings, combined with multi-dimensional SCS outcomes. Back pain surface decreased significantly greater for the ”SCS+PNfS” group (80.2% ± 21.3%) compared to the “SCS only” group (13.2% ± 94.8%) (p=0.012), highlighting the clinical interest of SCS+PNfS, in cases where SCS fails to address back pain.

The topic of this paper is the airborne evaluation of ICESat-2 Advanced Topographic Laser Altimeter System (ATLAS) measurement capabilities and surface-height-determination over crevassed glacial terrain, with a focus on the geodetical accuracy of geophysical data collected from a helicopter. To obtain surface heights over crevassed and otherwise complex ice surface, ICESat-2 data are analyzed using the density-dimension algorithm for ice surfaces (DDA-ice), which yields surface heights at the nominal 0.7~m along-track spacing of ATLAS data. As the result of an ongoing surge, Negribreen, Svalbard, provided an ideal situation for the validation objectives in 2018 and 2019, because many different crevasse types and morphologically complex ice surfaces existed in close proximity. Airborne geophysical data, including laser altimeter data (profilometer data at 905~nm frequency), differential Global Positioning System (GPS), Inertial Measurement Unit (IMU) data, on-board-time-lapse imagery and photographs, were collected during two campaigns in summers of 2018 and 2019. Airborne experiment setup, geodetical correction and data processing steps are described here. To date, there is relatively little knowledge of the geodetical accuracy that can be obtained from kinematic data collection from a helicopter. Our study finds that (1)~Kinematic GPS data collection with correction in post-processing yields higher accuracies than Real-Time-Kinematic (RTK) data collection. (2)~Processing of only the rover data using the Natural Resources Canada Spatial Reference System Precise Point Positioning (CSRS-PPP) software is sufficiently accurate for the sub-satellite validation purpose. (3)~Distances between ICESat-2 ground tracks and airborne ground tracks were generally better than 25~m, while distance between predicted and actual ICESat-2 ground track was on the order of 9~m, which allows direct comparison of ice-surface heights and spatial statistical characteristics of crevasses from the satellite and airborne measurements. (4)~The Lasertech Universal Laser System (ULS), operated at up to 300~m above ground level, yields full return frequency (400~Hz) and 0.06-0.08~m on-ice along-track spacing of height measurements. (5)~Cross-over differences of airborne laser altimeter data are 0.1918 $\pm$ 2.385~m along straight paths over generally crevassed terrain, which implies a precision of approximately 2.4~m for ICESat-2 validation experiments. (6)~In summary, the comparatively light-weight experiment setup of a suite of small survey equipment mounted on a Eurocopter (Helicopter AS-350) and kinematic GPS data analyzed in post-processing using CSRS-PPP leads to high accuracy repeats of the ICESat-2 tracks. The technical results (1)-(6) indicate that direct comparison of ice-surface heights and crevasse depths from the ICESat-2 and airborne laser altimeter data is warranted. The final result of the validation is that ICESat-2 ATLAS data, analyzed with the DDA-ice, facilitate surface-height determination over crevassed terrain, in good agreement with airborne data, including spatial characteristics, such as surface roughness, crevasse spacing and depth, which are key informants on the deformation and dynamics of a glacier during surge.

In many Bayesian computations, first, we obtain the expression of the joint distribution of all the unknown variables given the observed data. In general, this expression is not separable in those variables. Thus, obtaining their marginals for each variable and computing the expectations are difficult and costly. This problem becomes even more difficult in high dimensional quandaries, which is an important issue in inverse problems. We may then try to propose a surrogate expression with which we can do approximate computations. Often a separable expression approximation can be useful enough. The Variational Bayesian Approximation (VBA) is a technique that approximates the joint distribution $p$ with an easier, for example separable, one $q$ by minimizing Kullback–Leibler Divergence $KL(q|p)$. When $q$ is separable in all the variables, the approximation is also called Mean Field Approximation (MFA) and so $q$ is the product of the approximated marginals. A first standard and general algorithm is alternate optimization of $KL(q|p)$ with respect to $q_i$. A second general approach is its optimization in the Riemannian manifold. However, in this paper, for practical reasons, we consider the case where $p$ is in the exponential family and so is $q$. For this case, $KL(q|p)$ becomes a function of the parameters $\thetab$ of the exponential family. Then, we can use any other optimization algorithm to obtain those parameters. In this paper, we compare three optimization algorithms: standard alternate optimization, a gradient-based algorithm and a natural gradient algorithm and study their relative performances on three examples.

At present, diversified and highly concurrent businesses in the Internet industry often require heterogeneous databases formed by multiple databases to meet the needs. This report introduces database kernel SG-ColBase we developed. After achieving read and write concurrency control, data rollback, atomic log writing, and downtime data redo to ensure complete transaction support. The parallelism of database kernel execution is extended through field level locks and snapshot reads. Use the Bloom filter, resource cache pool, memory pool, skip list, non blocking log cache, and asynchronous data writing mechanism to improve the overall execution efficiency of the system. In terms of data storage, column storage, logical key and LSM-tree are introduced. While improving the data compression ratio and reducing data gaps, all disk data operations are written in incremental order. With the characteristics of asynchronous batch operation, the data writing speed is greatly improved. Thanks to the continuous feature of vertical data brought by column storage, the disk scanning brought by vertical traversal is reduced, which is a qualitative leap in efficiency compared with traditional relational databases in the big data analysis scenario. SG-ColBase can reduce the use of heterogeneous databases in business and improve R&D efficiency.

Real-world optimization problems are often gov- erned by one or more constraints. Over the last few decades, extensive research has been performed in Constrained Opti- mization Problems (COPs) fueled by advances in computational power. In particular, Evolutionary Algorithms (EAs) are a preferred tool for practitioners for solving these COPs within practicable time limits. We propose a novel hybrid Evolutionary Algorithm based on the Differential Evolution algorithm and Adaptive Parameter Gaining Sharing Knowledge-based algo- rithm to solve global real-world constrained parameter space. The proposed CHAGSKODE algorithm leverages the power of multiple adaptation strategies concerning the control parameters, search mechanisms, as well as uses knowledge sharing between junior and senior phases. We test our method on the benchmark functions taken from the CEC2020 special session & competition on real-world constrained optimization. Experimental results indicate that CHAGSKODE is able to achieve state-of-the- art performance on real-world constrained global optimization when compared against other well-known real-world constrained optimizers.

Although educational timetabling problems have been studied for decades, one type, the STP, has not developed as quickly as the other two types due to its diversity and complexity. Also, most of the STP research has only focused on the educators’ availabilities when studying the educator aspect, and the educators’ preferences and expertise have not been taken into consideration. This paper proposes a conceptual model for the school timetabling problem considering educators’ availabilities, preferences and expertise as a whole, and chooses a common real-world school timetabling scenario to study. A mathematical model is presented. A Virtual search space for dealing with the large search space is introduced, and the artificial bee colony algorithm is adapted and applied to the proposed model. The proposed approach is simulated with a random-generated large dataset. The experimental results demonstrate that the proposed approach is able to solve the STP and handle a large dataset in an ordinary computer hardware environment, which significantly reduces computational costs. Compared to the traditional CP method, the proposed approach is more effective and can provide more satisfactory solutions in considering educators’ availabilities, preferences, and expertise levels.

Since the discovery of graphene, due to its excellent optical, thermal, mechanical and electrical properties, it has a broad application prospect in energy, materials, biomedicine, electromagnetism and other fields. A great quantity of researches on the physical mechanism of graphene has been applied to engineering in electromagnetism and optics. To study the properties of graphene, different kinds of numerical methods have been developed for simulating the electromagnetic field effects of graphene, and equivalent boundary conditions have been employed to replace graphene in the computational domain. In this work, the numerical methods with equivalent boundary conditions are reviewed, and some examples are provided to illustrate their applicability.

By combining stochastic variational inference with message passing algorithms we show how to solve the highly complex problem of navigation and avoidance in distributed multi-robot systems in a computationally tractable manner, allowing online implementation. Subsequently, the proposed variational method lends itself to more flexible solutions than prior methodologies. Furthermore, the derived method is verified both through simulations with multiple mobile robots and a real world experiment with two mobile robots. In both cases the robots shares the operating space and needs to cross each other’s paths multiple times without colliding.

The corrugated board is a versatile and durable material that is widely used in the packaging industry. Its unique structure provides strength and cushioning, while its recyclability and bio-degradability make it an environmentally friendly option. The strength of corrugated board depends on many factors, including the type of individual papers on flat and corrugated layers, the geometry of the flute, temperature, humidity, etc. This paper presents a new approach to analysis geometric features of corrugated boards based on the images. It allows for precise determination of the geometry of the corrugated layer, as well as the thickness of individual papers in all cardboard layers. The experimental set used in the work and the created software are characterized by high reliability and precision of measurement thanks to the use of an identification procedure based on image analysis and evolutionary algorithms. This allows to quickly find the main geometric characteristics of the corrugated board, which in turn leads to the possibility of performing numerical analyzes taking into account the real model of the corrugated board. Calculations made on a real (correctly mapped geometrically) model allow, for example, a more reliable analysis of the composition of the cardboard, and thus also to obtain greater savings in the optimization process.

In this study, Acısu Basin, which is upper side of one of the most important basins (Gediz) in Türkiye, was modelled using three types of hydrological models and three different calibration algorithms. Lumped (GR4J), semi-distributed (SWAT+), and fully distributed (mHM) hydrological models were built and integrated with Parameter Estimation Tool (PEST) which is a model independent calibration tool including various algorithms. Levenberg Marquardt (L-M), Shuffled Complex Evolution (SCE), and Covariance Matrix Adoption Evolution Strategy (CMA-ES) were selected as calibration algorithms. Calibration period was 1991-2000, and validation results were obtained for 2002-2005. The effect of model structure and calibration algorithm selection on discharge simulation was evaluated via comparison of 9 different model-algorithm combinations. Results have shown that mHM and CMA-ES combination showed the best discharge simulation performance according to NSE values (calibration: 0.67, validation: 0.60). Although statistically the model results were classified as acceptable, the pattern comparison of discharge value shows that all of the models miss the peak values in significant amounts. This problem may be related to the interventions made in 2000-2001 years interval and possible to overcome by changing the calibration and validation periods, increasing the number of iterations or using the naturalized gauge data.

The shortage of quantum computers, and their current state of development, constraints research in many fields that could benefit from quantum computing. Although the work of a quantum computer can be simulated with classical computing, personal computers take so long to run quantum experiments that they are not very useful for the progress of research. This manuscript presents an open quantum computing simulation platform that enables quantum computing researchers to have access to high performance simulations. This platform, called QUTE, relies on a supercomputer powerful enough to simulate general purpose quantum circuits of up to 38 qubits, and even more under particular simulations. This manuscript describes in-depth the characteristics of the QUTE platform and the results achieved in certain classical experiments in this field, which would give readers an accurate idea of the system capabilities.

Obstructive Sleep Apnea (OSA) is nowadays one of the respiratory pathologies with a higher in-cidence globally in developed countries. This situation led to an increase in the demand for medical appointments and diagnostic studies related to that condition, especially those based on poly-somnographies and cardiorespiratory polygraphies. These studies are limited in resources, causing long waiting lists with the subsequent impact on the patients’ health. Furthermore, it is necessary to mention that OSA’s symptomatology is not very specific, and it is typically present in the general population (excessive sleepiness, snore, etc.). In this regard, this paper proposes a novel intelligent clinical decision support system for the diagnosis of OSA which could be used to help medical teams, both in primary care settings and in units specialized in respiratory pathologies. The aim of the proposed system is to help discriminate the patients suspected of suffering from the pathology from those who are not. To this end, two types of information sets of heterogeneous nature are consid-ered. The first one encompasses objective data, related to the patient's health profile with infor-mation usually available in electronic health records. The second type comprises subjective data, referred to the symptomatology reported by the patient in a previous interview. To process the first group of information, a Machine Learning classification algorithm is used, Bagged Trees in this case. For processing the second information set, related with the symptomatology of the patient, a col-lection of expert systems based on fuzzy inferential systems arranged in cascade are employed. As a result, the system is able to determine two risk indicators related to the patient's risk of suffering from OSA: the Statistical Risk and the Symbolic Risk respectively. Subsequently, by interpreting both risk indicators mentioned it will be possible to determine the severity of the patients’ health, proposing a preliminary evaluation on their condition. For the initial tests of the system, a software artifact has been built using a dataset with 4,978 selected patients, suspected of suffering from OSA, from the Álvaro Cunqueiro Hospital in Vigo. The results obtained are promising, demonstrating the potential usefulness of this type of tools in medical diagnosis. Once the system has been validated with new data from clinical environments, it is considered as possible to obtain a relevant improvement in the quality of the healthcare services, and a reduction in the associated costs.

This article investigated the Automatic Generation Control(AGC) of multi-area multi-source interconnected systems with hydropower plants, thermal power plants, and wind energy. Adaptive Neuro-fuzzy controller integrated with the cascaded proportional-integral-derivative with filter (PIDF-PIDF) is a new cascaded controller (ANF-PIDF-PIDF) that has been presented as a secondary controller for applied hybrid power systems. The recent Skill Optimization Algorithm (SOA) is employed to optimize PIDF- PIDF controller parameter gains and the Adaptive Neuro-Fuzzy controller's inputs and output scaling factors. SOA is used to update the controller parameters with integral square error (ISE) employed as the objective function. A 1% step load disturbance was considered simultaneously in all three areas. The controller's performance is evaluated and compared with and without considering the effects of wind energy sources and non-linearity for ANF-PIDF-PIDF, PIDF-PIDF, and PIDF and it was determined that the ANF-PIDF-PIDF was the most efficient. The dynamic system performance is also compared with parallel high voltage direct current (HVDC) tie-lines. The investigation clearly shows that incorporating HVDC tie-line with multi-area, multi-source provides better dynamic performance in maximum amplitude, oscillation, and settling time. Additionally, sensitivity analysis is done and the optimum controller gains does not need to be reset to uncertain values in system loading conditions. All simulation results were evaluated using MATLAB 2016b.

The development of quantum computers seeks software developers' attention regarding security in the era of Information Technology, software security is the primary goal for our quantitative assessment of software security in the development cycle of software. Security assessment of software is identifying the key security factors of the software. A security elective provides ex-tensive strategies and calculations to ensure product safety. The security assessment is the key factor in surveying, administering, and controlling security to further enhance the nature of safety. It should be acknowledged that assessing security early on in the development process is beneficial in identifying worms, hazards, flaws, and threats. The definition and portrayal of Quantum Computing (QC) in software security will be discussed in this study. Researchers use cryptography calculations to secure our financial institutions, medical devices, military weaponry, planes, ships, vehicles, and pilots. Here authors of this study use the Fuzzy Technique for Order Preference by Similarity to Ideal Situation (FTOPSIS) to quantitatively assess the weight/rank of the quantum enable security alternatives like (Diffie-Hellman key-exchange algorithm, Quantum key distribution algorithm, Deutsch-Jozsa Algorithm, Special Deutsch-Jozsa Algorithm, Grover’s Algorithm and Quantum key distribution algorithm in GHZ state) with security factors like (Confidentiality, Integrity, Authenti-cation, Privacy, Reliability, Maintainability, Authorization, Integrity, Possessions, and Availability). Additionally, they critically analyze and select the six alternatives of quantum-based security algorithms. The nature of safety infers the ability to execute a thing on time in this exploration study, specifically 'software security'.

Phosphorus (P) is the most important substance in inorganic fertilizers used in agriculture industry. In this study, a multi-product and multi-objective model is presented considering economic and environmental concerns to design a renewable and sustainable P-fertilizer supply chain management (PFSCM). To handle complexities of the proposed model, an ensemble knowledge-based three-stage heuristic-metaheuristic algorithm utilizing heuristic information available in the model, whale optimization algorithm, and variable neighborhood search (named H-WOA-VNS) is proposed. At first, a problem-dependent heuristic is designed to generate a set of near-optimal feasible solutions. These solutions are fed into a population-based whale optimization algorithm which benefits from both exploration and exploitation strategies. Finally, a single-solution metaheuristic based on variable neighborhood search is applied to further improve the quality of the solution using local search operators. The objective function of the algorithm is formulated as a weighted average function to minimize total economic cost, while increasing crop yield and P use efficiency. Experimental results over five synthetic datasets and a real case study of the P-fertilizer supply chain confirm the superiority of the proposed method against the state-of-the-art techniques. The results demonstrate that the proposed method performs well in optimizing both the economic cost and environmental issues.

The paper portrays predictive models for dissolved oxygen (DO) levels in an urban lake using common water quality parameters like Temperature, pH, Conductivity and ORP at a time. Data were sampled using three real-time, industry-standard sensors, OPTOD, CTZN, and PHEHT, and then interpolated using the ArcGIS kriging technique. Correlation studies were analyzed through the ML algorithm, the correlation study signified a highly positive correlation between DO and other water parameters and the model was corroborated by R-score in order to create the linear regression model. In addition, an artificial neural network- a machine learning method using the Levenberg-Marquardt algorithm was developed to build a model to predict the do as well. Then, the performance of the models was validated and also the R² accuracy was checked of the predicted data against the actual data. Thus, the appropriateness of the ANN model for the forecasting of investigated attributes is indicated by the fact that the discrepancy between the forecasted and real ANN model is significantly lesser than that of the regression model. However, the model can be used to reveal DO data from unknown urban lake water.

The continuously developing project aims to build an informatics system enabling analysis of spatial and temporal parameters of movement activities occurring in the sport of speed climbing. The monitoring system (climbing information speed system – CISS) is to be used for conducting comprehensive scientific research in the field of speed climbing. The system enables the evaluation of the training process of climbers at various levels of competition. The study analysis was based on video. The video recording with a camera positioned at a short distance (10 m) from the wall. The marker was positioned closest to the centre of mass (gravity) BMC. Results: development of a system for data collection and analysis of the climbing run based on video recording (application of the Kanade-Lucas-Tomasi (KLT) algorithm). Our results showed that used devices can measure a wide range of specific internal and external variables during speed climbing. Some of the analyzed parameters were significantly correlated with speed climbing time. These results could be a theoretical basis for future research and for training program’s preparation.

Understanding the function of a locus is a challenge in molecular biology. Although numerous molecular data have been generated in the last decades, it remains difficult to grasp, how these data are related at a locus? In this study, we describe an analytical workflow that can solve this problem using the knowledge available at single-nucleotide polymorphisms (SNPs) level. The underlying algorithm uses SNPs as connectors to link omics data and identify correlation between them through a joint bioinformatical/statistical approach. We describe its application in finding the mechanism whereby a mutation causes a phenotype and in revealing the path whereby a gene is being regulated and impacts the phenotypes. We translated our workflow into freely available shell scripts that carry out the analyses. Our approach provides a basic framework to solve the information overload problem in biology.

The deployment of a Static Synchronous Compensator within a microgrid can facilitate voltage and reactive power regulation, leading to enhanced stability and reliability. Within a microgrid setting, a STATCOM can effectively balance power supply and demand, and mitigate voltage fluctuations caused by the intermittent nature of renewable energy sources. To ensure the successful integration of a STATCOM within a microgrid, coordinating the control system with other Distributed Energy Resources, especially when multiple control strategies are employed, can be a challenging task. Therefore, a meticulously designed control system is indispensable to guarantee the microgrid’s efficient and effective operation. The use of GA in LSTM tuning can accelerate the process of finding optimal hyperparameters for a specific task, obviating the necessity for time-consuming and computationally expensive grid search or manual tuning. This method can be particularly advantageous when handling large data sets and complex models. In this paper, an attempt has been made to model the STATCOM to communicate with the microgrid tuned using LSTM-GA for effective calculation of real and reactive power support during grid disturbances.

The service conditions of underground coal mine equipment are poor, and it is difficult to accurately extract the fault characteristics of rolling bearings. In order to better improve the accuracy of fault identification of rolling bearings, a fault detection method based on multiscale permutation entropy and SOA-SVM is proposed. First, the whale optimization algorithm is used to select the modal analysis number K and the penalty factor α of the variational mode decomposition algorithm. Then, the vibration signal of rolling bearings is dissolved according to the optimized variational mode decomposition algorithm, and the multi-scale permutation entropy of the main intrinsic mode function is calculated. Finally, the feature values of the matrix are entered into the SVM algorithm optimized by the seagull optimization algorithm to obtain the classification result. The experimental results based on the published rolling bearing datasets of Western Reserve University show that the identification success rate of the proposed method can reach 98.75%. The fault detection of the rolling bearings can be completed accurately and efficiently.

Abstract Background and Objective: Medical Microwave Radiometry (MWR) is used to capture the thermal properties of internal tissues and has usages in breast cancer detection. Our goal in this paper is to improve classification performance and investigate automated neural architecture search methods. Methods: We investigate optimizing the weights of a weight agnostic neural network using bi-population covariance matrix adaptation evolution strategy (BIPOP-CMA-ES) once the topology is found. We compare it against a weight agnostic and cascade correlation neural network. Results: The experiments are conducted on a breast cancer dataset of 4912 patients. Our proposed weight agnostic BIPOP-CMA-ES model achieved the best performance. It obtained an F1-score of 0.9225, accuracy of 0.9219, precision of 0.9228, recall of 0.9217 and topology of 153 connections. Conclusions: The results are an indication of the potential of MWR utilizing a neural network-based diagnostic tool for cancer detection. By separating the tasks of topology search and weight training, we are able to improve the overall performance.

Evaporation from surface water plays a key role in water accounting of basins, water resources management, and irrigation systems management, so simulating evaporation with high accuracy is very important. In this study, two methods for simulating pan evaporation under different climatic conditions in Iran were developed. In the first method, six experimental relationships (linear, quadratic, and cubic, with two input combinations) were determined for Iran’s six climate types, inspired by a multilayer perceptron neural network (MLP-NN) neuron and optimized with the genetic algorithm. The best relationship of the six was selected for each climate type, and the results were presented in a three-dimensional graph. In the second method, the best overall relationship obtained in the first method was used as the basic relationship, and climatic correction coefficients were determined for other climate types using the genetic algorithm optimization model. Finally, the accuracy of the two methods was validated using data from 32 synoptic weather stations throughout Iran. For the first method, error tolerance diagrams and statistical coefficients showed that a quadratic experimental relationship performed best under all climatic conditions. To simplify the method, two graphs were created based on the quadratic relationship for the different climate types, with the axes of the graphs showing relative humidity and temperature, and with pan evaporation was drawn as contours. For the second method, the quadratic relationship for semi-dry conditions was selected as the basic relationship. The estimated climatic correction coefficients for other climate types lay between 0.8 and 1 for dry, semi-dry, semi-humid, Mediterranean climates, and between 0.4 and 0.6 for humid and very humid climates, indicating that one single relationship cannot be used to simulate pan evaporation for all climatic conditions in Iran. The validation results confirmed the accuracy of the two methods in simulating pan evaporation under different climatic conditions in Iran.

This work proposes a physics-based identification technique based on genetic algorithms. The main objective is to obtain a parametric matrix A that describes the time-invariant linear model of the longitudinal dynamics of an aircraft. This is achieved by proposing a fitness function based on the properties of the transition matrix and taking advantage of some of the capabilities of the genetic algorithm, mainly those of restricting the search ranges of the unknowns. In this case, such unknowns are related to the type of aircraft and flight conditions that are considered during the identification process. The proposed identification method is validated with a reliable nonlinear model that can be found in the literature, as well as with the calculation of the trim condition and linearization generally used in aircraft dynamics. In summary, this study suggests the genetic algorithm provided with the adequate fitness function, could be an appealing alternative for aircraft model identification, even when only a limited amount of data is available. Furthermore, in some cases, linearization using genetic algorithm can be more efficient than classical methods.

Building facade design plays an essential role in enhancing energy efficiency and reducing environmental impact in high-performance building design. Balancing the conflicts among various building facade design parameters to satisfy different optimization objectives constitutes a highly complex optimization problem. The rapidly increasing number of studies demonstrates a significant interest in implementing multi-objective optimization methods to tackle building facade optimization problems. This study conducts a systematic review of optimization methods for building facade optimization (BFO). The optimization objectives and design variables are categorized based on their characteristics. The efficiency and effectiveness of optimization algorithms in addressing BFO problems are compared. Building optimization techniques and tools are showcased, along with their functions and limitations. Key findings highlight the robust feasibility and effectiveness of optimization algorithms, methods, and techniques in resolving a diverse range of BFO challenges. The limitations, challenges, and future potential of these methods are summarized and proposed.

Background: ChatGPT is becoming a new reality. Where do we go from here? Objective: to show how we can distinguish ChatGPT-generated publications from counterparts produced by scientist. Methods:By means of a new algorithm, called xFakeBibs, we show the significant difference between ChatGPT-generated fake publications and real publications. Specifically, we triggered ChatGPT to generate 100 publications that were related to Alzheimer’s disease and comorbidity. Using TF-IDF, using the real publications, we constructed a training network of bigrams comprised of 100 publications. Using 10-folds of 100 publications each, we also 10 calibrating networks to derive lower/upper bounds for classifying articles as real or fake. The final step was to test xFakeBibs against each of the ChatGPT-generated articles and predict its class. The algorithm successfully assigned the POSITIVE label for real ones and NEGATIVE for fake ones. Results: When comparing the bigrams of the training set against all the other 10 calibrating folds, we found that the similarities fluctuated between (19%-21%). On the other hand, the mere bigram similarity from the ChatGPT was only (8%). Additionally, when testing how the various bigrams generated from the calibrating 10-folds against ChatGPT we found that all 10 calibrating folds contributed (51%-70%) of new bigrams, while ChatGPT contributed only 23%, which is less than 50% of any of the other 10 calibrating folds. The final classification results using the xFakeBibs set a lower/upper bound of (21.96-24.93) number of new edges to the training mode without contributing new nodes. Using this calibration range, the algorithm predicted 98 of the 100 publications as fake, while 2 articles failed the test and were classified as real publications. Conclusions: This work provided clear evidence of how to distinguish, in bulk ChatGPT-generated fake publications from real publications. Also, we also introduced an algorithmic approach that detected fake articles with a high degree of accuracy. However, it remains challenging to detect all fake records. ChatGPT may seem to be a useful tool, but it certainly presents a threat to our authentic knowledge and real science. This work is indeed a step in the right direction to counter fake science and misinformation.

Malignant growth is the most widely recognized repulsive infections winning around the world, and the patients with disease are saved just when the malignant growth is distinguished at the beginning phase. Each kind of disease is interesting, with its own arrangement of development properties and hereditary changes. This paper presents the lung knob division and disease characterization by proposing an enhancement calculation. The general technique of the created approach includes four stages, such as pre-processing, division, highlight extraction, and the order. From the outset, the CT picture of the lung is taken care of to the division. When the division is done, the highlights are extricated through morphological and measurable and surface highlights like LOOP and LGP. At long last, the extricated highlights are given to the order step. Here, the characterization is done dependent on the Deep Belief Network (DBN) which is prepared by utilizing the proposed Chicken-Sine Cosine Algorithm (CSCA) which distinguish the lung tumor, giving two classes in particular, knob or non-knob. The presentation assessment of lung knob division and malignant growth grouping dependent on CSCA is figured utilizing three measurements to be specific, precision, affectability, and the explicitness.

This paper uses the numerical results of surveys sent to Huelva’s (Andalusia, Spain) households to determine the degree of knowledge they have about the urban water cycle, needs, values, and attitudes regarding water in an intermediary city with low water stress. In previous research, we achieved three different households’ clusters. The first one grouped households with high knowledge of the integral water cycle and a positive attitude to smart devices at home. The second cluster described households with low knowledge of the integral water cycle and high sensitivity to price. The third one showed average knowledge and predisposition to have a closer relationship with the water company. This paper continues with this research line, applying Classification and Regression Trees (CART) to determine which hierarchy of variables/factors/ independent components obtained from the surveys are the decisive ones to predict the range of household water consumption in Huelva. Positive attitudes towards improved cleaning habits for personal or household purposes are the highest hierarchy component to predict the water consumption range. Second in the hierarchy, the variable Knowledge Global Score about the integral urban water cycle, associated with water literacy, also contributes to predicting the water consumption range. Together with the three clusters obtained previously, these results will allow us to design water demand management strategies (WDM) fit for purpose that enable Huelva’s households to use water more efficiently.

The environmental disaster in Kamchatka in the autumn of 2020 was caused by an extensive bloom of harmful microalgae of the genus Karenia. A spectral shape algorithm was used to detect algae. The algorithm calibration of in situ species composition data made it possible to identify areas where harmful algae dominated in biomass. Satellite images of chlorophyll-a concentra-tion, turbidity, specific fluorescence, and spectral shape parameter were computed. The images were used to recognize the stages of algal bloom: intensive growth, blooming, and change in the dominant algal species. Cases of an increase in the concentration of harmful substances in the coastal zone due to wind impact were analyzed. The following explanation of events has been offered. After the stage of intensive growth of microalgae, nutrient deficiency stimulated the production of metabolites that have a harmful effect on the environment. The change of the dominant alga species in the second half of September and the past storm contributed to a sharp increase in the concentration of metabolites and dead organic matter in the coastal zone, which caused an ecological disaster. The subsequent mass bloom of alga species of the same genus, and the regular wind impact leading to the concentration of harmful substances in the coastal zone, contributed to the development of this catastrophic phenomena.

Due to production space and operating environment requirements, mine production equipment often breaks down, which seriously affects the mine’s production schedule. To ensure the smooth completion of the haulage operation plan under abnormal conditions, a model of the haulage equipment rescheduling plan based on the random simulation of equipment breakdowns is established in this paper. The model aims to accomplish both the maximum completion rate of the original mining plan and the minimum fluctuation of the ore grade during the rescheduling period. This model is optimized by improving the wolf colony algorithm and changing the location update formula of the individuals in the wolf colony. Then, the optimal model solution can be used to optimize the rescheduling of the haulage plan by considering equipment breakdowns. The application of the proposed method in an underground mine revealed that the completion rate of the mine’s daily mining plan reached 83.40% without increasing the number of the equipment, while and the ore quality was stable. Moreover, the improved optimization algorithm converged fast and was characterized by high robustness.

The integration of transportation systems with land use through the Transit-Oriented Development (TOD) model can effectively promote sustainable development in cities. By increasing the intensive use of land within the supply capacity of urban public transportation, this model can comprehensively improve the efficiency of urban transportation and land use, while also addressing problems such as traffic congestion and environmental pollution. To implement this model, a "Node-Place-Function" (NPF) framework is proposed based on the coordination degree between rail transit and land use in Qingdao. A comprehensive evaluation system is constructed to quantitatively assess the TOD level and comprehensive development level of land use around rail transit stations from three dimensions. By applying the NSGA-II genetic algorithm, a land use allocation optimization model is developed to maximize rail transit station accessibility, land economic benefits, and environmental comfort. The research results guide other cities in China to implement TOD in land use planning and promote coordinated development between urban rail transit and land use.

Slime Mould Algorithm (SMA) is a new swarm intelligence algorithm inspired by the oscillatory behavior of slime molds during foraging. Numerous researchers have widely applied SMA and its variants in various domains and proved its value by the experiments in literatures. In this paper a comprehensive survey on SMA is introduced, which is based on 130 articles visa Google-scholar between 2022 and July, 2023. Firstly, the theory of SMA is described. Secondly the improved SMA variants are provided and categorized according to the approach that they are applied with. Finally, it also discusses the main applications domains of SMA such as engineering optimization, energy optimization, machine learning, network, scheduling optimization, image segmentation and etc. This review presents some research suggestion for researcher who is interested in this algorithm.

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

Continuous water resources monitoring is needed for sustainable urban water supply. Remote sensing techniques have proven useful for monitoring some water qualitative parameters with optical characteristics. The study area was the Marateca reservoir in central inland Portugal. The aims were the following: (1) to explore the water quality parameters at the monitoring points of the Marateca reservoir that may explain the event; (2) to validate optical water quality parameters with the monitoring points data; and (3) to model the reservoir water characteristics regarding its deepness, trophic state, and turbidity. The parameters total phosphorus, total nitrogen, and chlorophyll-a were used to compute a trophic level index. The Sentinel-2 imagery was used to compute spectral indices and bands image ratio; to obtain spectral signatures for the monitoring points, and to model water characteristics. The water parameters were above the recommended values at the reservoir entry point from the Ocreza River. The reservoir trophic level was Hypereutrophic and Eutrophic. The spectral signatures confirmed a Hypereutrophic pattern in the entry point. The Marateca reservoir’s water characteristics modeling forecasted problematic zones by contamination. The methodological approach developed can be easily applied to other reservoirs and is a key support tool for decision-makers.

The high penetration of intermittence resources in the energy market accelerates significantly the decarbonization process but, on the other hand, the electrical system has to face the problem of unbalances. Renewable Energies Sources (RES) are hard to precisely forecast, and power plants are not able to predict the amount of energy that they can provide far from the real time delivery. In this frame, the intraday market gets a fundamental role allowing agents to adjust their position close to the delivery time. In this work we suggest an agent-based model of intraday market combined with genetics algorithms to understand what the best strategy could be adopted by players in order to optimize the market efficiency in terms of welfare and unsold quantity. In the first part we show the effect on the market prices of different scenarios in which players aim at maximizing their revenues and selling/buying all their volumes. In the second part we show the effect of a particular genetic algorithm on the model, focusing on how agents can adapt their strategy to enhance the market efficiency. Comparative analyses are also performed to investigate how the welfare of the system increases as well as the unsold quantity decrease when genetic algorithm is introduced

Lithium batteries are widely used due to their advantages such as high energy density, stable performance, low pollution, and long recyclable life. Accurate SOC estimation is important for the use of lithium batteries. To address the problem of low accuracy of SOC estimation by traditional methods, this paper proposes a joint method of fractional order robust unscented Kalman filter (FORUKF) and robust unscented Kalman filter (RUKF) to estimate SOC. The method is based on a fractional order model (FOM) that combines the unscented transformation (UT) technique, the H∞ observer and the joint estimator. Specifically, an adaptive genetic algorithm (AGA) was first used to identify the parameters of the FOM for lithium batteries and to verify the accuracy of the model. Estimation and updating of the ohmic resistance R0 and the capacity QN in the model in real-time by RUKF and then estimation of the SOC by FORUKF. Finally, the accuracy of FORUKF-RUKF was verified under the Federal Urban Driving Schedule (FUDS), US06 Highway Driving Schedule and Beijing Dynamic Stress Test (BJDST). According to the results, the FORUKF-RUKF estimated SOC was found to have better accuracy and robustness than the RUKF, FOUKF and EKF.

In this work we derive a generalized series expansion of the acrtangent function by using the enhanced midpoint integration (EMI). Algorithmic implementation of the generalized series expansion utilizes a simple two-step iteration. This approach significantly improves the convergence and requires no surd numbers in computation of the arctangent function.

The purpose of this work was to evaluate a novel methodology developed by Digital Blood Corporation (DBC) to calculate critical blood values using four non-invasive measured values as input. The values obtained using a point-of-care testing (POCT) device were utilized for comparison and reference. Radial arterial blood was collected for the POCT comparator analysis using the Abbott i-STAT^® device. The non-invasive methodology from DBC requires four parameters to be directly measured: temperature, hemoglobin, pO2, and pCO2. Subsequently, sodium, potassium, chloride, ionized calcium, total carbon dioxide, pH, bicarbonate, and oxygen saturation are calculated using an algorithm. The agreement between the POCT and DBC’s methodology was analyzed using Bland-Altman difference plots. For a second data set, pO2 and pCO2 values collected with the POCT were used as input for DBC’s algorithm to test its robustness. Data from 37 healthy ambulatory individuals, mean age: 42.4 + 13 years; range: 18-64 years, were included in the primary analysis. In the case of the non-invasive gained four input values the greatest variation between POCT and DBC’s approach was observed for pO2 and consequently for algorithm values that depend upon pO2 precision. Replacing transcutaneous pO2 and pCO2 with POCT values demonstrates the principal ability of DBC’s algorithm to predict the additional 8 blood values in sufficient agreement with a standard POCT device in healthy patients. The algorithm developed by DBC appears to be robust in the case of healthy patients but does need the four measured input values with preciseness comparable to a POCT device to give reliable and clinically relevant results. The present study thus serves as a proof of concept to facilitate future study and further development of this methodology into a non-invasive device.

Among the various complex systems that we experience each day, there is the physical phenomenon of infiltration. Infiltration is considered as the dynamics of water flow in the subsurface soil that in this work is framed for the context of civil construction. This issue is approached with the use of mathematical models and stochastic techniques, however, there are hardships in collecting the samples in the field, the adoption of a scale type, the influence in soil layers interfaces, the effects of soil anisotropic characteristics and so on. In this study, methodology is proposed to deal with the soil sampling input such as the retro model, constitutive model and optimization algorithms. Additionally, an automatic calibration is set forth to fix parameters from the mathematical model submitted. Especially among the existing Optimization Algorithms there are Genetic Algorithms and the Generalized Simulated Annealing Algorithm (GSA). This work presents an overview of these optimization methods and a proposal for a more efficient and faster algorithm called GSA-HYBRID based on convergence gradient technique. The applied strategy depends on the type of case study considering its physical properties and constraints. In this sense, it is found that while Genetic Algorithms are able to replicate the optimization surface, Generalized Simulated Annealing is much more adequate in characterizing the system at an extremely low computational cost. Nevertheless, the hybrid technique GSA-HYBRID performed the fastest. Further research is necessary to implement the novel GSA-HYBRID algorithm due to its flexibility and higher speed, also, studying its application at different case studies.

The Steepest Descent (or Ascent) algorithm is one of the most widely used algorithms in Science, Technology, Engineering, and Mathematics (STEM). However, this powerful mathematical tool is neither taught nor even mentioned in K12 education. We study whether it is feasible for elementary school students to learn this algorithm, while also aligning with the standard school curriculum. We also look at whether it can be used to create enriching activities connected to children’s real-life experiences, thus enhancing the integration of STEM and fostering Computational Thinking. To address these questions, we conducted an empirical study in two phases. In the first phase, we tested the feasibility with teachers. In a face-to-face professional development work-shop with 457 mathematics teachers actively participating using an online platform, we found that after a 10-minute introduction they could successfully apply the algorithm and use it in a couple of models. They were also able to complete two complex and novel tasks: selecting models and adjusting the parameters of a model that uses the steepest descent algorithm. In a second phase, we tested the feasibility with 90 fourth graders from 3 low Socioeconomic Status (SES) schools. Using the same introduction and posing the same questions, we found that they were able to understand the algorithm and successfully complete the tasks on the online platform. Additionally, we found that close to 75% of the students completed the two complex modeling tasks and performed similarly to the teachers.

Digital healthcare systems play a pivotal role in providing efficient and accessible healthcare services. However, ensuring secure authentication and key agreement mechanisms is essential to protect sensitive patient data and maintain the integrity of the system. The existing methods face limitations in terms of vulnerability to cyber attacks, scalability, and resource utilization. Furthermore, the integration of blockchain technology introduces new complexities that need to be addressed. This research proposes an optimized fuzzy logic approach combined with blockchain technology to address the authentication and key agreement challenges in digital healthcare systems. The proposed solution leverages the flexibility and adaptability of fuzzy logic algorithms to handle uncertainty and imprecision in authentication decisions. By employing fuzzy logic, the system can effectively minimize false positives and false negatives, enhancing the robustness against adversarial attacks. Moreover, the integration of blockchain technology provides a decentralized and tamper-proof infrastructure for securely storing and managing authentication and key agreement data. This ensures transparency and trust in the system, mitigating the risks of unauthorized access and data manipulation. The blockchain-based architecture also enables efficient resource utilization and scalability, allowing the system to handle authentication requests in a timely manner, even in large-scale digital healthcare environments.The proposed method is evaluated by using the NIST Special Database 302 and it shows superior performance compared to existing methods, with minimum False Rejection Rate (FRR), False Acceptance Rate (FAR), and response time. Moreover, the proposed method minimizes communication overhead during the authentication process and resists different cyber attacks including a Replay attack, Man-in-the-middle attack, Denial of Service (DoS) attack, and Impersonation attack. The proposed method achieves excellent performance in terms of security, efficiency, and resistance to various cyber-attacks, making it a promising approach for secure data sharing in P2P cloud environments.

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

Coded aperture 3D imaging techniques have been rapidly evolving in the recent years. The two main directions of evolution are in aperture engineering to generate the optimal optical field and in development of computational reconstruction to reconstruct the object’s image from the intensity distribution with a minimal noise. The goal is to find the ideal aperture-reconstruction method pair and if not, to optimize one to match the other for designing an imaging system with required 3D imaging characteristics. Lucy-Richardson-Rosen algorithm (LR²A), a recently developed computational reconstruction method was found to perform better than its predecessors such as matched filter, Weiner filter, phase-only filter, Lucy-Richardson algorithm and non-linear reconstruction (NLR) for certain apertures when the point spread function (PSF) is a real and symmetric function. For other cases of PSF, NLR performed better than the rest of the methods. In this tutorial, LR²A has been presented as a generalized approach for any optical field along with MATLAB codes for reconstruction of any image when the PSF is known. The common problems and pitfalls in using LR²A has been discussed. Simulation and experimental studies for common optical fields such as spherical, Bessel, vortex beams and exotic optical fields such as Airy, scattered and self-rotating beams have been presented. From this study, it can be seen that it is possible to transfer the 3D imaging characteristics from non-imaging type exotic fields to indirect imaging systems faithfully using LR²A. The application of LR²A to medical images such as colonoscopy images and cone beam computed tomography images with synthetic PSF has been demonstrated. We believe that the tutorial will provide a deeper understanding of computational reconstruction using LR²A.

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

Pattern recognition techniques form the heart of most, if not all, incoherent linear shift-invariant systems. When an object is recorded using a camera, the object information gets sampled by the point spread function (PSF) of the system, replacing every object point with the PSF in the sensor. The PSF is a sharp Kronecker Delta-like function when the numerical aperture (NA) is large with no aberrations. When the NA is small, and the system has aberrations, the PSF appears blurred. In the above case, if the PSF is known, then the object information can be obtained by scanning the PSF over the recorded object intensity pattern and looking for pattern matching conditions through a mathematical process called correlation. In this study, a recently developed deconvolution method, the Lucy-Richardson-Rosen algorithm (LR2A), has been implemented to computationally refocus images recorded in the presence of spatio-spectral aberrations. The performance of LR2A was compared against the Lucy-Richardson algorithm and non-linear reconstruction. LR2A exhibits a superior deconvolution capability even in extreme cases of spatio-spectral aberrations and blur. Experimental results of deblurring a picture captured using high-resolution smartphone cameras are presented. LR2A was implemented to significantly improve the performances of the widely used deep convolutional neural networks for image classification.

Blasting pattern optimization is an attempt to optimize blast design parameters aiming to achieve optimum fragmentation, reduce mining operating costs as well as environmental side consequences. The present study aims to propose a multi-objective optimization model, employing artificial intelligence and metaheuristics, to simultaneously minimize the mine-to-crusher operating costs and the impact of blasting consequences including fly-rock and back-break. To achieve the purpose of the study, a multi-variable regression model was developed to model total costs from drilling to crushing. In addition to the costs, multilayer perception neural networks were implemented to predict the blast-induced back-break and fly-rock as a function of collected variables such as number of holes, hole length, burden, spacing, hole slope, stemming, blasted rock per hole, powder factor, and charge per delay. High-precise estimations for both back-break and fly-rock were achieved with the average of 99% coefficient of determination for train, test and validation data sets. Then, the developed regression model and the neural networks were used in an optimization framework, employing Grasshopper algorithm, to find the optimum blast design satisfying practical constraints. The proposed model was tested on a lead-zinc open-pit mine, where 1032 blasting patterns were recorded and analyzed. The results of the optimization model provide a Pareto set of solutions, such that any of these solutions can be implemented according to the strategy of the mining operation management team. The blast pattern with the lowest cost, result in a relatively high fly-rock and back-break, while the pattern with low fly-rock and back-break raises the cost by 20.13 % compared the minimum cost blast design.

The literature has well established prestressing in concrete beams and its calculation procedures. However, its use in composite steel-concrete beams has increased despite main normative codes lacking a specific approach for it. Designers must, in most cases, combine the available criteria to calculate the standards of steel and reinforced concrete structures. This study aimed to formulate this optimization problem and analyze CO2 emissions for the optimal design of composite steel-concrete beams with external prestressing. The design variables for the optimization problem include cross-section of laminated or welded profiles, slab height, characteristic strength of concrete to compression, and number of tendons. We obtained a solution for the optimization problem via a genetic algorithm (GA) and a particle swarm optimization one (PSO). Comparative analysis with experimental example and with optimization problem of prestressed steel beam are performed. An parametric analysis to several spams is performed, which enabled to evaluate the factors that most impact CO2 emissions. According to results, the chosen algorithms effectively obtained solutions for the problem, and PSO usually provided better results than GA. Regarding the final solution composition, steel contributes the most to emissions, welded profiles provided better solutions than laminated ones, and laminated spans of up to 17.5m and welded ones up to 27.5m dispensed with tendons.

To predict the remaining useful life (RUL) of proton exchange membrane fuel cell (PEMFC) in advance, a prediction method based on the voltage recovery model and Bayesian optimization of a multi-kernel relevance vector machine (MK-RVM) is proposed in this paper. First, the empirical mode decomposition (EMD) method was used to preprocess the data, and then the MK-RVM was used to train the model. Then, the Bayesian optimization algorithm was used to optimize the weight coefficient of the kernel function to complete the parameter update of the prediction model, and the voltage recovery model was added to the prediction model to realize the rapid and accurate prediction of the RUL of PEMFC. Finally, the method proposed in this paper was applied to the open data set of PEMFC provided by FCLAB, and the prediction accuracy of the RUL of PEMFC was obtained by 95.35%, which showed that the method had good gen-eralization ability and verified the accuracy of the prediction for the RUL of PEMFC.

In the era of big data with increasingly complex data structures and ever-larger data scales, matrix-type data are becoming highly valued and their applications in the fields of medicine, industry, education, geography, and astronomy are growing in extent. In recent years, significant progress has been made in the practical use of matrix variable t-distribution finite mixture models for handling data in order to address the issues of multi-subgroup structures and long data tails. In this paper, the expectation-maximization (EM) algorithm with penalized maximum likelihood is proposed to resolve the problem of the unbounded nature of the likelihood function applied to the model by considering the degeneracy of the variance-covariance matrix of this model. Our data were analyzed through simulations and real data, and the results demonstrate that our model is effective in both preventing the likelihood function from being unbounded and in ensuring the accuracy of the estimated parameters of the EM algorithm.

Efficient train driving plays a vital role in reducing the overall energy consumption in the railway sector. An energy minimising control strategy can be computed using the framework given by optimal control theory, in particular the Pontryagin maximum principle. Our optimisation approach is based on an algorithm presented by Khmelnitsky that considers electric trains equipped with regenerative braking. A derivation of Khmelnitsky’s theory from a more general formulation of the maximum principle is given in this article, and a complete list of switching cases between different driving regimes has been included that is essential for practical application. A number of numerical examples are added to visualise the various switching cases. Energy consumption data from real-life operation of passenger trains are compared to the calculated energy minimum. In the presented study, the optimised strategy was able to save 37 percent of the average energy demand of the train in operation.

Modern agriculture requires technology to give precise measures about relevant parameters such as pest control. Here, we developed an algorithm model as base for bait spray intervention, by monitoring the olive fruit fly, Bactrocera oleae (Rossi), with conventional traps, in 24.3 Hectares of non-irrigated Baladi olive cultivars, in Hassbaya region. We installed 49 yellow sticky traps with ammonium bicarbonate. The adults, males and females were monitored, on weekly basis. The traps and the trees were georeferenced, and the parameters such as temperature, relative humidity, tree phenology (BBCH), and fruit load rate were compiled. The results showed that the infested fruits were correlated as much with the fruit load rate as with the number of adults captures which were correlated more to the temperature than the relative humidity. The number of the males captured was higher than the females all over the cultivation period. The first symptoms of the fruits were observed from 22 September when the BBCH was equal to 85%, with an average of adult captures lesser than 5 adults by trap by 7 days.

The stator winding insulation system is the most critical and weak part of the EMU's (electric multiple unit) traction motor. The effective diagnosis for stator ITSC (inter-turn short-circuit) faults can prevent the fault from expanding into phase-to-phase or ground short-circuits. The TCU(traction control unit) controls the traction inverter to output SPWM (sine pulse width modulation) excitation voltage when the traction motor is stationary. Three ITSC fault diagnostic conditions are based on different IGBTs control logic. The Goertzel algorithm is used to calculate the fundamental current amplitude difference Δi and phase angle difference Δθ of equivalent parallel windings under the three diagnostic conditions. The six parameters under the three diagnostic conditions are used as features to establish an ITSC fault diagnostic model based on random forest. The proposed method was validated using a simulation experimental platform for ITSC fault diagnosis of EMU traction motors. The experimental results indicate that the current amplitude features Δi and phase angle features Δθ change obviously with the increase of ITSC fault extent if the ITSC fault occurs at the equivalent parallel windings. The accuracy of the ITSC fault diagnosis model based on the random forest for ITSC fault detection and location both in train and test samples are 100%.

Machine learning (ML) is widely used in the field of crop-growing information identification based on high-resolution remote sensing images. With Baoying County in Jiangsu Province, China, as the study area, this paper used Sentinel-2 images during the winter wheat growth period to construct its spectral, textural, and topographic features during its growth period and proposes a winter wheat-growing area extraction method based on the extreme gradient boosting (XGBoost) algorithm, which was compared with traditional ML algorithms such as the support vector machine (SVM), classification and regression tree (CART), and random forest (RF) algorithms. The results indicated that (1) a winter wheat-growing area identification model based on the XGBoost algorithm was successfully constructed based on Sentinel-2 images, considering 27 spectral, textural, and topographic features; (2) the constructed model could effectively extract winter wheat in the study area with an overall accuracy of 93.43% and only a small error compared with the actual winter wheat-growing area in Baoying County, meeting the accuracy requirement for crop identification in the study area; and (3) the deep learning algorithm XGBoost outperformed the three traditional ML algorithms, among which the RF algorithm was better than the SVM and CART algorithms, both of which had poor identification performance and a large error compared with the actual growing area. This paper provides a scientific basis for the accurate extraction of winter wheat-growing areas and further research on winter wheat growth monitoring and yield estimation.

The fast and reliable processing of medical images is of paramount importance to adequately generate data to feed machine learning algorithms that can prevent and diagnose health issues. Here we benchmark different compressed sensing techniques applied to magnetic resonance imaging as a means to reduce the acquisition time spent in the collection of data and signals that form the image. We show that by using these techniques, it is possible to reduce the number of signals needed and, therefore, substantially decrease the time to acquire the measurements. To this end, we have considered and compared different algorithms: the Iterative Re-Weighted Least Squares, the Iterative Soft Thresholding Algorithm, the Iterative Hard Thresholding Algorithm, the Primal Dual Algorithm and the Log-Barrier Algorithm. We have implemented such algorithms in different analysis programs that have been used to perform the reconstruction of the images and found that the Iterative Soft Thresholding Algorithm gives the optimal results. We found that the images obtained with this algorithm have less quality than the original ones, but the quality is good enough to distinguish each body structure and detect any health problems.

Researchers are always looking to find ways to use energy more efficiently while keeping people comfortable at home. They've tried different methods like fuzzy logic and genetic algorithms to do this. In this paper, we introduce a novel model that combines different techniques like data smoothing, optimization, machine learning, and control algorithms to reach this goal in smart homes. The proposed model is made up of three main parts: smoothing, optimization, and control. The smoothing part uses the Kalman filter to get rid of any unnecessary noise and make sure the data used to predict energy use is clean and smooth. The optimization part uses both genetic with firefly algorithms and artificial neural networks to minimize the gap between the actual environmental conditions and the conditions users find comfortable. It adjusts the comfort settings in real-time using machine learning. The control part uses Mamdani fuzzy logic to make sure energy is delivered in the best way possible to the systems that control temperature, lighting, etc., making the home comfortable and saving energy at the same time. Comparative analyses demonstrate the superiority of the proposed model over existing algorithms, including the Particle Swarm Optimization (PSO) algorithm. Additionally, the paper discusses the importance of adaptive controllers in addressing issues associated with incorrect PID controller selection and highlights the benefits of using the FA-GA in energy optimization and comfort improvement. Overall, the proposed model offers an effective solution for efficient energy consumption optimization and enhanced user comfort in diverse settings through the integration of advanced algorithms and optimization modules.

The volume of vehicular traffic in large cities has increased in recent years, the devices that collect vehicular GPS data such as cameras, GPS receivers and others generate millions of records at every instant of time generating problems in processing and storage of these data which becomes important for researchers. Intelligent Transportation Systems perform vehicle monitoring and control by collecting GPS trajectories, this large volume of information is necessary to have an optimal storage process. Its processing by means of compression techniques and simplification algorithms allow to reduce the necessary storage space. This paper presents a GPS trajectory simplification algorithm that considers noise reduction, point simplification and analysis of road network information. The results obtained on two data sets from the cities of California and Beijing are satisfactory, achieving a higher compression ratio without affecting data quality

In recent decades, there have been numerous endeavors to develop a novel category of survival distributions possessing enhanced flexibility through the extension of existing distributions. This article constructs and validates the statistical properties of a novel survival distribution in order to obtain an alternative distribution that is suitable for analyzing survival data by presenting the novel mixture of the Fréchet distribution along with statistical properties such as the probability density function (PDF), cumulative distribution function (CDF), rth ordinary moment, skewness, kurtosis, moment-generating function, mean, variance, mode, survival function, hazard function, and asymptotic behavior, as well as constructing the estimators of the unknown parameter by employing the expectation-maximization (EM) algorithm, and simulated annealing. Additionally, the performance of the proposed estimators was compared with bias, mean squared errors (MSE), and simulated variances, and given an illustrative example of the proposed distribution to the survival data set in order to show that the proposed distribution is appropriate for the right-skewed data. This will be extremely advantageous in survival analysis.

In response to reducing the energy cost of unmanned surface vehicles (USVs) while overcoming the low accuracy problem in surface target detection, a lightweight detection algorithm with multi-scale feature fusion is proposed. Based on the popular one-stage lightweight Yolov7-tiny target detection model, a lightweight extraction module is designed first by introducing the multiscale residual module to reduce the number of parameters and computational complexity while improving accuracy. The Mish and SiLU activation functions are used to enhance network feature extraction. Second, the path aggregation network employs coordinate convolution to strengthen spatial information perception. Finally, the dynamic head, which is based on the at-tention mechanism, improves the representation ability of object detection heads without any computational overhead. According to the experimental findings, the proposed model has 22.1% fewer parameters than the original model, 15% fewer GFLOPs, a 6.2% improvement in mAP@0.5, a 4.3% rise in mAP@0.5:0.95, and it satisfies the real-time criteria. According to the research, the suggested lightweight water surface detection approach includes a lighter model, a simpler computational architecture, more accuracy, and a wide range of generalizability. It performs bet-ter in a variety of difficult water surface circumstances.

Based on the satellite attitude control method, this paper proposes an attitude control method based on neural network disturbance compensation. The paper firstly analyzes the neural network algorithm and proposes an orthogonal least squares algorithm to implement network learning. In this paper, a set of high-precision directional neural network compensation controllers is designed for the attitude control of acupuncture small satellites. The feasibility of the improved orthogonal least-squared algorithm combined with the neural network supplementary control method in satellite attitude control is verified by experiments.

In this paper, stochastic multi-objective intelligent framework (MOIF) is performed for distribution network reconfiguration to minimize power losses, the number of voltage sags, the system's average RMS fluctuation, the average system interruption frequency (ASIFI), the momentary average interruption frequency (MAIFI), and the system average interruption frequency (SAIFI) considering the network uncertainty. The unscented transformation (UT) approach is applied to model the demand uncertainty due to simplicity to implement and no presumptions to simplify. A human-inspired intelligent method named improved mountaineering team-based optimization (IMTBO) is applied to determine the decision variables defined as the network's optimal configuration. The conventional MTBO is improved using a quasi-opposition-based learning strategy to overcome premature convergence and achieve the optimal solution. The simulation results showed that in single- and double-objective optimization, some objectives are weakened compared to their base value, while the results of the MOIF indicated a fair compromise between different objectives, and all objectives are improved. The results of MOIF based on the IMTBO cleared that the losses are reduced by 30.94%, the voltage sag numbers and average RMS fluctuation are reduced by 33.68% and 33.65%, and also ASIFI, MAIFI, and SAIFI are improved by 6.80%, 44.61%, and 0.73%, respectively. Also, the superior capability of the MOIF based on the IMTBO is proved compared to the conventional MTBO, particle swarm optimization, and artificial electric field algorithm. Moreover, the results of the stochastic MOIF based on the UT showed the power loss increased by 7.62%, voltage sag, and SARFI increased by 5.39% and 5.31%, and ASIFI, MAIFI, and SAIFI weakened by 2.28%, 6.61%, and 1.48%, respectively compared to the deterministic MOIF model.

In recent decades, the Variational AutoEncoder (VAE) model has shown good potential and capabilities in image generation and dimensionality reduction. The combination of VAE and various machine learning frameworks has also worked effectively in different daily life applications, however its possibility and effectiveness in modern game design has seldom been explored nor assessed. The use of its feature extractor for data clustering was minimally discussed in literature neither. This paper first attempts to explore different mathematical properties of the VAE model, in particular, the theoretical framework of the encoding and decoding processes, the possible achievable lower bound and loss functions of different applications; then applies the established VAE model into generating new game levels within two well-known game settings; as well as validating the effectiveness of its data clustering mechanism with the aid of the Modified National Institute of Standards and Technology (MNIST) database. Respective statistical metrics and assessments were also utilized for evaluating the performance of the proposed VAE model in aforementioned case studies. Based on the statistical and spatial results, several potential drawbacks and future enhancement of the established model were outlined, with the aim of maximizing the strengths and advantages of VAE for future game design tasks and relevant industrial missions.

This paper aims to provide the smart grid research community with an open and accessible general mathematical framework to develop and implement optimal flexibility mechanisms in large-scale network applications. The motivation of this paper is twofold. On the one hand, flexibility mechanisms are currently a hot topic of research, which is aimed to mitigate variation and uncertainty of electricity demand and supply in decentralised grids with a high aggregated share of renewables. On the other hand, a large part of such related research is performed by heuristic methods, which are generally inefficient (such methods do not guarantee optimality) and difficult to extrapolate for different use cases. Alternatively, this paper presents an MPC-based (Model Predictive Control) framework explicitly including a generic flexibility mechanism which is easy to particularise to specific strategies such as Demand Response, Flexible Production and Energy Efficiency Services. The proposed framework is benchmarked with other non-optimal control configurations to better show the advantages it provides. The work of this paper is completed by the implementation of a generic use case which aims to further clarify the use of the framework and thus, to ease its adoption by other researchers in their specific flexibility mechanisms applications.

Accurate and reliable measurement of real-world walking activity is clinically relevant, particularly for people with mobility difficulties. Insights on walking can help understand mobility function, disease progression, and fall risks. People living in long-term residential care environments have heterogeneous and often pathological walking patterns, making it difficult for conventional algorithms paired with wearable sensors to detect their walking activity. We designed two walking bout detection algorithms for people living in long-term residential care. Both algorithms used thresholds on the magnitude of acceleration from a 3-axis accelerometer on the lower back to classify data as “walking” or “non-walking”. One algorithm had generic thresholds, while the other used personalized thresholds. To validate and evaluate the algorithms, we compared the classifications of walking/non-walking from our algorithms to the real-time research assistant annotated labels and the classification from an algorithm validated on a healthy population. Both the generic and personalized algorithms had acceptable accuracy (0.83 and 0.82 respectively). The personalized algorithm showed the highest specificity (0.84) of all tested algorithms, meaning it was the best suited to determine input data for gait characteristic extraction. The developed algorithms were almost 60% quicker than the previously developed algorithms, suggesting they are adaptable for real-time processing.

Disease detection and prediction have been one of the most frequent uses of machine learning models in the last decade, and Parkinson's disease is no exception. It is common for people in their old age to have one form of disease or another depending on the circumstances in which they find themselves. This study analyzed and evaluated various supervised machine learning models to detect the presence of Parkinson's disease in elderly individuals. An extreme gradient boosting model, along with other models, such as naïve Bayes, random forest, K-nearest neighbor, and support vector machine (SVM), was implemented to determine the best outcome. The extreme gradient boosting (XGBoost) model is a powerful boosting machine learning technique, particularly in terms of speed and accuracy. The results showed that the XGBoost model, which is an optimized version of the other boosting models, is capable of projecting the presence of Parkinson's disease with very high accuracy compared to other algorithms. The implemented classification algorithm extreme gradient boosting method achieved approximately 98 % accuracy, 97.5 % precision, 100.0 % recall, and 98.7% f1-score which are high compared with the results found in the existing literature.

This paper considers the application of two selected algorithms (Cuckoo Search CS, Firefly Algorithm FA) to determine and maximize the reliability of a two complex system known from the literature. This system operates with resource constraints. In addition, several classical methods for determining the reliability of systems have been applied. Although the CS algorithm is known for its effectiveness as it uses the Lévy flight, for the presented optimization tasks the FA firefly algorithm in the considered parameter range proved to be more effective. The presented results broaden the existing discussion on the application of nature-inspired algorithms for solving RRAP (Reliability Redundancy Allocation Problem) problems. From this point of view, two described test scenarios can be considered as a suitable tool for validating other algorithms in RRAP problems. Not only the values of the criterion functions can be compared, but also other introduced parameters and statistical analyse of variance (ANOVA) with post-hoc RIR Tuckey test was discussed.

To achieve an acceptable level of security on the web, the Completely Automatic Public Turing test to tell Computer and Human Apart (CAPTCHA) was introduced as a tool to prevent bots from doing destructive actions such as downloading or signing up. Mobile devices have small screens, and therefore, using the common CAPTCHA methods (e.g. text CAPTCHAs) in these devices raises usability issues. To introduce a reliable, secure, and usable CAPTCHA that is suitable for mobile devices, this paper introduces a hand gesture recognition CAPTCHA based on applying Genetic Algorithm (GA) principles on Multi-Layer Perceptron (MLP). The proposed method improves the performance of MLP-based hand gesture recognition. It has been trained and evaluated on 2201 videos of the IPN Hand dataset, and MSE and RMSE benchmarks report the index values of 0.0018 and 0.0424, respectively. Comparison with the related works shows a minimum of 1.79% fewer errors, and experiments produced a sensitivity of 93.42% and accuracy of 92.27% – 10.25% and 6.65% improvement compared to the MLP implementation.

Premature ventricular complexes (PVCs) are frequently encountered in clinical practice. The association of PVCs with adverse cardiovascular outcomes in the context of structural heart disease is well established, yet the association between PVCs and cardiovascular outcomes in the absence of structural heart disease is not fully elucidated. Cardiac magnetic resonance (CMR) seems to contribute prognostically in the latter subgroup. PVC- induced myocardial dysfunction refers to the impairment of ventricular function due to the PVCs and is mainly associated with a PVC burden greater than 10%. The surface 12- lead ECG is used to localize the anatomic site of origin and multiple algorithms have been developed to differentiate right ventricular and left ventricular outflow tract (RVOT and LVOT, respectively) origin. Novel algorithms include alternative ECG configurations and lately, sophisticated artificial intelligence methods have been utilized to distinguish the origins of outflow tract arrhythmias. The decision to therapeutically address PVCs should be taken upon the presence of symptoms or the development of PVC- induced myocardial dysfunction. The therapeutic modalities include pharmacological therapy, namely I-C antiarrhythmic drugs and beta blockers, as well as catheter ablation, which demonstrates superior efficacy and safety.

Anomaly Detection in real time data is accepted as a vital research area. Clustering has effectively been tried for this purpose. As the datasets are real time, the time of generating of the data is also important. In this article, we introduce a mixture of partitioning and agglomerative hierarchical approach to detect anomalies from such datasets. It is a two-phase method which follows partitioning approach first and then agglomerative hierarchical approach. The dataset can have mixed attributes. In phase-1, a unified metric defined on mixed attributes is used. The same is also used for merging of similar clusters in phase-2. Also, we have kept the track of time attribute of each data instance which produces the clusters with their lifetimes in phase-1. Then in phase-2, we merge the similar clusters. While merging, the similar clusters, the lifetimes of the corresponding clusters with overlapping cores are to be superimposed producing fuzzy time intervals. This way, each cluster will have an associated fuzzy lifetime. The data instances either belonging sparse clusters or not belonging to any of the clusters can be treated as anomalies. The efficacy of the algorithms can be established using both complexity analysis as well as experimental studies.

: Seasonal influenza (a.k.a flu) is responsible for considerable morbidity and mortality across the globe. The three recognized pathogens that cause epidemics during the winter season are influenza A, B and C. The influenza virus is particularly dangerous due to its mutability. Vaccines are an effective tool in preventing seasonal influenza, and their formulas are updated yearly according to WHO recommendations. However, in order to facilitate decision-making in the planning of the intervention, policymakers need information on the projected costs and quantities related to introducing the influenza vaccine, in order to help governments obtain an optimal allocation of the vaccine each year. In this paper, an approach based on a Controlled Elitism Non-Dominated Sorting Genetic Algorithm (CENSGA) model is introduced to optimize the allocation of influenza vaccination. A bi-objective model is formulated to control the infection volume, and reduce the unit cost of the vaccination campaign. An SIR (Susceptible–Infected–Recovered) model is employed for representing a potential epidemic. The model constraints are based on the epidemiological model, time management, and vaccine quantity. A two-phase optimization process is proposed: guardian control followed by contingent controls. The proposed approach is an evolutionary metaheuristic multi-objective optimization algorithm with a local search procedure based on a hash table. Moreover, in order to optimize the scheduling of a set of policies over a predetermined time to form a complete campaign, an extended CENSGA is introduced with a variable-length chromosome (VLC) along with mutation and crossover operations. To validate the applicability of the proposed CENSGA, it is compared with the classical Non-Dominated Sorting Genetic Algorithm (NSGA-II). The results are analyzed using graphical and statistical comparisons in terms of cardinality, convergence, distribution and spread quality metrics, illustrating that the proposed CENSGA is effective and useful for determining the optimal vaccination allocation campaigns.

SARS-CoV-2 Omicron variant spike RBD epitopes in complex with spike (S) -protein D614G mutations now predominate globally and increase infectivity by assembling more functional S proteins into the virion. On average, homeopathic medicine contains less than one molecule per dose on average. Single variable SphericalHarmonicY, LaguerreL, WhittakerM, SphericalBesselJ, LegendreP, LegendreQ, LaguerreL, ChebyshevT, and Hypergeometric1F1 Functions pFqarise in connection with the power series solution of the Schrodinger equation or in the summation of perturbation expansions in quantum mechanics. A quantum interpretation of the homeopathic method is presented here through a novel algebraic topology approach to supersymmetry and symmetry breaking in quantum fields and quantum gravity theory with the aim of developing a wide range of physical-based drug design applications in a Small Molecule Quantized Water Memory Network suggesting that the Hidden Black Hole Paradox of Information Loss might be solved under suitable conditions.

Abstract: The Micro-Electro-Mechanical System (MEMS) LiDAR point cloud in autonomous vehicles has a large deflection range, which results in slow registration speed and poor applicability. To maximize speed, an improved NDT (Normal Distribution Transform) method that integrates point cloud density features has been proposed. First, the point cloud is reduced using a modified voxel filter and a pass-through filter. Next, the ISS (Intrinsic Shape Signature) algorithm is utilized to analyze the point cloud features and extract keypoints, the 4PCS (4-Point Congruent Sets) algorithm is then employed to calculate the initial pose under the constraints of the keypoint set to complete the coarse registration. Finally, the self-adaptive segmentation model is constructed by using KD-tree to obtain the density features of keypoints, and the NDT algorithm is combined with this model to form an SSM-NDT algorithm, which is used for fine registration. Each algorithm was compared on the autonomous vehicle dataset PandaSet and actual collected data sets, the results show that the novel method increases the speed by at least 60% and takes into account good registration accuracy and strong anti-interference.