Data generated by metagenomic and metatranscriptomic experiments is both enormous and inherently noisy [1]. When using taxonomy-dependent alignment-based methods to classify and label reads, such as MEGAN [2], the first step consists in performing homology searches against sequence databases. To obtain the most information from the samples, nucleotide sequences are usually compared to various databases (i.e., nucleotide and protein) using local sequence aligners such as BLASTN and BLASTX [3]. Nevertheless, the analysis and integration of these results can be problematic because the outputs from these searches usually show differences, which can be notorious when working with RNA-seq (Personal observation; Graphical abstract). These inconsistencies led us to develop the HoSeIn workflow to determine the unequivocal taxonomic and functional profile of environmental samples, based on the assumption that the sequences that correspond to a certain taxon are composed of (Graphical abstract): 1) sequences that were assigned to the same taxon by both homology searches, plus 2) sequences that were assigned to that taxon by one of the homology searches but returned no hits in the other one, and vice versa.

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

Complete digraphs are referred to in the combinatorics literature as tournaments. We consider a family of semi-simplicial complexes, that we refer to as ``tournaplexes'', whose simplices are tournaments. In particular, given a digraph G, we associate with it a ``flag tournaplex'' which is a tournaplex containing the directed flag complex of G, but also the geometric realisation of cliques that are not directed. We define several types of filtrations on tournaplexes, and exploiting persistent homology, we observe that flag tournaplexes provide finer means of distinguishing graph dynamics than the directed flag complex. We then demonstrate the power of these ideas by applying them to graph data arising from the Blue Brain Project's digital reconstruction of a rat's neocortex.

We present a new computing package Flagser, designed to construct the directed flag complex of a finite directed graph, and compute persistent homology for flexibly defined filtrations on the graph and the resulting complex. The persistent homology computation part of Flagser is based on the program Ripser [2], but is optimised specifically for large computations. The construction of the directed flag complex is done in a way that allows easy parallelisation by arbitrarily many cores. Flagser also has the option of working with undirected graphs. For homology computations Flagser has an Approximate option, which shortens compute time with remarkable accuracy. We demonstrate the power of Flagser by applying it to the construction of the directed flag complex of digital reconstructions of brain microcircuitry by the Blue Brain Project and several other examples. In some instances we perform computation of homology. For a more complete performance analysis, we also apply Flagser to some other data collections. In all cases the hardware used in the computation, the use of memory and the compute time are recorded.

Reconstructing ancestral species is a challenging endeavour: fossils are often scarce or enigmatic, and inferring ancestral characters based on novel molecular approaches (e.g. comparative genomics or developmental genetics) has long been controversial. A key philosophical challenge pertinent at present is the lack of a theoretical framework capable of evaluating inferences of homology made through integration of multiple kinds of evidence (e.g. molecular, developmental, or morphological). Here, I present just such a framework. I start with a brief history and critical assessment of attempts at inferring morphological homology through developmental genetics. I then bring attention to a recent model of homology, namely Character Identity Mechanisms (DiFrisco, Love, & Wagner, 2020), intended partly to elucidate the relationships between morphological characters, developmental genetics, and homology. I utilise and build on this model to construct the evaluative framework mentioned above, which judges the epistemic value of evidence of each kind in each particular case based on three proposed criteria: effectiveness, admissibility, and informativity, as well as providing a generalised guideline on how it can be scientifically operationalised. I then point out the evolution of the eumetazoan body plan as a case in point where the application of this framework can yield satisfactory results, both empirically and conceptually. I will conclude with a discussion on some potential implications for more general philosophy of biology and philosophy of science, especially surrounding evidential integration, models and explanation, and reductionism.

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

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

Pathogenicity of many bacteria including Bacillus cereus and Staphylococcus aureus depends on pore-forming toxins (PFTs), which cause lysis of host cells by forming pores in membranes of eukaryotic cells. Bioinformatic analysis revealed in over 600 PFTs a region homologous to the Lys171-Gly250 sequence in hemolysin II (HlyII) from B. cereus, which we designated as “homologous peptide”. Three β-barrel PFTs were used for a detailed comparative analysis. Two of them –HlyII and cytotoxin K2 (CytK2), – are synthesized in Bacillus cereus sensu lato; the third – S. aureus α-toxin (Hla) – is the most investigated representative of the family. Protein modeling showed certain amino acids of homologous peptide to be located on the surface of the monomeric forms of these β-barrel PFTs. We obtained monoclonal antibodies against both a cloned homologous peptide and a 14-membered synthetic peptide DSFNTFYGNQLFMK as part of homologous peptide. The HlyII, CytK2 and Hla regions recognized by the obtained antibodies, as well as an antibody capable of suppressing the hemolytic activity of CytK2, were identified in the course of the work. Antibodies capable of recognizing PFTs of various origins can be useful tools for both identification and suppression of the cytolytic activity of PFTs.

In this paper we establish a topological framework of τ-structures to quantify the evolutionary transitions between two RNA sequence-structure pairs. τ-structures developed here consist of a pair of RNA secondary structures together with a non-crossing partial matching between the two backbones. The loop complex of a τ-structure captures the intersections of loops in both secondary structures. We compute the loop homology of τ-structures. We show that only the zeroth, first and second homology groups are free. In particular, we prove that the rank of the second homology group equals the number γ of certain arc-components in a τ-structure, and the rank of the first homology is given by γ−χ+1, where χ is the Euler characteristic of the loop complex.

Euryale ferox, which belongs to the family of Nymphaeaceae, has been widely distributed in China, India, Korea, and Japan. The seeds of E. ferox (EFS) have been categorized as superior food for 2000 years in China, based on its abundant nutrients including polysaccharides, polyphenols, sesquineolignans, tocopherols, cyclic dipeptides, glucosylsterols, cerebrosides, and triterpenoids. These constituents exert multiple pharmacological effects, such as antioxidant, hypoglycemic, cardioprotective, antibacterial, anticancer, antidepression, and hepatoprotective properties. There are very few summarized reports on E. ferox, albeit with its high nutritional value and beneficial activities. Therefore, we collected the reported literatures (since 1980), medical classics, databases, and pharmacopeia of E. ferox, and summarized the botanical classification, traditional uses, phytochemicals, and pharmacological effects of E. ferox, which will provide new insights for the further research and development of EFS-derived functional products.

Three-dimensional structure of six closely related hydrogenases from purple bacteria has been modeled by combining template-based and ab initio modeling approach. The results lead to conclusion that there should be 4Fe3S-cluster in the structure of these enzymes. Thus, these hydrogenases could drive attention for exploring their oxygen tolerance and practical applicability in hydrogen fuel cells. Analysis of 4Fe3S-cluster's microenvironment showed intragroup heterogeneity. Possible function of the C-terminal part of the small subunit in membrane binding has been discussed. Comparison of the built models with existing hydrogenases of the same subgroup (membrane-bound oxygen-tolerant hydrogenases) has been carried out. Analysis of intramolecular interactions in the large subunits showed statistically reliable differences in number of hydrophobic interactions and number of ionic interactions. Molecular tunnels were mapped in the models and compared with structures from PDB. Protein-protein docking showed that these enzymes could exchange electrons in oligomeric state, which is important for oxygen-tolerant hydrogenases. Molecular docking with model electrode compounds showed mostly the same results as with hydrogenases from E.coli, H. marinus, R. eutropha, S. enterica; some interesting results were shown in case of HupSL from Rba. sphaeroides and Rvx. gelatinosus.

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

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

At least six small alternate-frame open reading frames (ORFs) overlapping well-characterized SARS-CoV-2 genes have been hypothesized to encode accessory proteins. Researchers have used different names for the same ORF or the same name for different ORFs, resulting in erroneous homological and functional inferences. We propose standard names for these ORFs and their shorter isoforms, developed in consultation with the Coronaviridae Study Group of the ICTV. We recommend calling the 39 codon Spike-overlapping ORF ORF2b; the 41, 57, and 22 codon ORF3a-overlapping ORFs ORF3c, ORF3d, and ORF3b; the 33 codon ORF3d isoform ORF3d-2; and the 97 and 73 codon Nucleocapsid-overlapping ORFs ORF9b and ORF9c. Finally, we document conflicting usage of the name ORF3b in 32 studies, and consequent erroneous inferences, stressing the importance of reserving identical names for homologs. We recommend that authors referring to these ORFs provide lengths and coordinates to minimize ambiguity due to prior usage of alternative names.

Topological Data Analysis (TDA) refers to a collection of methods that find the structure of shapes in data. Although recently, TDA methods have been used in many areas of data mining, it has not been widely applied to text mining tasks. In most text processing algorithms, the order in which different entities appear or co-appear is being lost. Assuming these lost orders are informative features of the data, TDA may play a significant role in the resulted gap on text processing state of the art. Once provided, the topology of different entities through a textural document may reveal some additive information regarding the document that is not reflected in any other features from traditional text processing methods. In this paper, we introduce a novel approach that hires TDA in text processing in order to capture and use the topology of different same-type entities in textural documents. First, we will show how to extract some topological signatures in the text using persistent homology-i.e., a TDA tool that captures topological signature of data cloud. Then we will show how to utilize these signatures for text classification.

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

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

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

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

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

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

Leucyl-aminopeptidase (LAP), an important metallopeptidase, hydrolyses amino acid residues from the N-terminal of polypeptides and proteins, acting preferentially on the peptide bond formed by N- terminus leucine. A new leucyl-aminopeptidase was found in Bacillus cereus CZ. Its gene (bclap) contained a 1485 bp ORF encoding 494 amino acids with a molecular weight of 54 kDa. The bcLAP protein was successfully expressed in E. coli BL21(DE3). Optimal activity is obtained at pH 9.0 and 58°C. The bcLAP displays a moderate thermostability and an alkaline pH adaptation range. Enzymatic activity is dramatically enhanced by Ni2+. EDTA significantly inhibits the enzymatic activity, and bestatin and SDS also show strong inhibition. The three-dimensional model of bcLAP monomer and homohexamer is simulated by Phyre2 server and SWISS-MODEL server. The docking of bestatin, Leu-Trp, Asp-Trp and Ala-Ala-Gly to bcLAP is performed using AutoDock4.2.5 , respectively. Molecular docking results show that the residues Lys260, Asp265, Lys272, Asp283, Asp342, Glu344, Arg346, Gly372, His437 are involved in the hydrogen bonding with the ligands and zinc ions. There may be two nucleophilic catalytic mechanisms in bcLAP, one involving His 437 or Arg346 and the other involving His437 and Arg346. The bcLAP can hydrolyse the peptide bonds in Leu-Trp, Leu-Trp and Ala-Ala-Gly.

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

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

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

Equipped with an early social predisposition immediately post-birth, humans typically form associations with mothers and other family members through exposure learning, canalized by a spontaneous predisposition to biological motion, face configuration, and other cues of animacy. If impaired, reduced social preferences can lead to social interaction impairments such as autism spectrum disorder (ASD) via misguided canalization. Despite being taxonomically distant, domestic chicks also follow a homologous developmental trajectory toward adaptive socialization through imprinting, which is guided via predisposed preferences that are homologous to those of humans, thereby suggesting that chicks are valid animal models of ASD. In addition to the convergent similarities in predisposition with human newborns, accumulating evidence suggests the construct validity of the chick model. Considering the recent progress in the evolutionary neurobiology of vertebrates, we reviewed the advantages and limitations of the chick model of developmental mental diseases in humans.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Abstract: The venom-containing barb attached to their ‘whip-like’ tail provides stingrays a defensive mechanism for evading predators such as sharks. From human encounters, dermal stingray envenomation is characterized by intense pain often followed by tissue necrosis occurring over several days to several weeks. The bioactive components in stingray venoms (SRV’s) and their molecular targets and mechanisms that mediate these complex responses are not well understood. Given the utility of venom-derived proteins from other venomous species for biomedical and pharmaceutical applications, we set out to characterize the bioactivity of SRV from three local species that belong to the Dasyatoidea ‘whiptail’ superfamily. Multiple cell-based assays were used to quantify and compare the in vitro effects of these SRV’s on different cell lines. All three SRV’s demonstrated concentration-dependent growth inhibitory effects on three different human cell lines tested. In contrast, a mouse fibrosarcoma cell line was markedly resistant to all three SRV’s, indicating the molecular target(s) for mediating the SRV effects are not expressed on these cells. The multifunctional SRV responses were characterized by an acute disruption of cell adhesion leading to apoptosis. These findings aim to guide future investigations of identified SRV proteins and their molecular targets for potential use in biomedical applications.

Persistent Organic Pollutants (POP) such as dichlorodimethyltrichloroethane (DDT) are present and ubiquitous in the environment due to their resilient nature. DDT is a prevalent endocrine disruptor still found in detectable amounts in organisms and the environment even after its use was banned in the 1970s. Studies show that exposure to DDT can cause adverse health effects in humans and animals, impairing fertility and increasing the risk of developing cancer. The aim of this work is to provide a comprehensive overview of the available literature on the effect of DDT and its metabolites on female reproductive tract, leading to infertility and cancer. Medline and Google Scholar were systematically searched to detect all relevant animal and human studies published in the last 20 years (January 2003 to February 2023) in accordance with the Preferred Reporting Items for Systematic Reviews and Meta-analyses (PRISMA) statement. In total, 38 studies were included for qualitative synthesis. This systematic search and review indicated that exposure to DDT is associated with female reproductive health decline and that DDT acts as a sufficient carcinogen instigating reproductive cancers.

We introduce Get Free Copy (getfreecopy.com), a web-based platform designed to streamline the search for biomedical literature across major repositories like arXiv, bioRxiv, medRxiv, and PubMed Central (PMC). Addressing challenges posed by paywalls and fragmented databases, it offers a unified interface for efficient retrieval of free, legitimate copies of biomedical literature. The platform's implementation involves a Node.js backend and dynamic front-end display, enhancing accessibility and research efficiency. As an open-source project, Get Free Copy represents a significant contribution to the open-access movement, inviting global researcher collaboration for further development.

To deal with the uncertainties in modeling offshore wind turbines, we proposed a parameter inversion method for the pile-soil interaction model based on structural health monitoring results and the numerical model. The proposed parameter inversion method has a numerical model, an objective function selected using both the numerical and identified results, and an inverse optimization using a random search algorithm in the assumed parameter space. The parameter results in the minimum optimization objective function are identified as the in-situ parameter. The proposed method is confirmed to converge after some iterations, whatever the initial parameter values are. However, different initial parameter cases may converge to slightly different optimal parameters, implying the pile results are sensitive to geological parameters. Moreover, a comparison with the original design results shows design redundancy or risks. Though the proposed method has several flaws, it can shed some light on the influence of uncertainties in offshore wind turbines, such as soil parameters in geological surveys.

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.

Transcriptionally controlled tumor protein (TCTP) is a highly conserved protein performing a large number of cellular functions by binding with various partner proteins. The importance of its roles in many diseases requires an assay method to find regulatory compounds. However, the molecular characteristics of TCTP made it difficult to search for chemicals interacting with it. In this study, a tryptophan-based assay method was designed and Y151W mutant TCTP was constructed to search binding chemicals. Since there is no tryptophan in the native sequence of TCTP, the incorporation of tryptophan in the Y151W mutant was very effective to establish the method. A flavonoid library was employed to the assay with the method. With the native and Y151W mutant TCTPs, three flavonoids such as morin, myricetin and isobavachalcone have been found to interact with TCTP. Combined with native gel electrophoresis, the binding region of isobavachalcone was suggested to be the flexible loop of TCTP. This approach can be easily applicable to find binding compounds of proteins with similar molecular characteristics of TCTP.

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

Molecular overtone transitions provide optical frequency transitions sensitive to variation in the proton-to-electron mass ratio (μ = m_p/m_e). However, robust molecular state preparation presents a challenge critical for achieving high precision. Here, we characterize infrared and optical-frequency broadband laser cooling schemes for TeH⁺, a species with multiple electronic transitions amenable to sustained laser control. Using rate equations to simulate laser cooling population dynamics, we estimate the fractional sensitivity to μ attainable using TeH⁺. We find that laser cooling of TeH⁺ can lead to significant improvements on current μ variation limits.

General Variable Neighborhood Search (GVNS) is a well known and widely used metaheuristic for efficiently solving many NP-hard combinatorial optimization problems. Quantum General Variable Neighborhood Search (qGVNS) is a novel, quantum inspired extension of the conventional GVNS. Its quantum nature derives from the fact that it takes advantage and incorporates tools and techniques from the field of quantum computation. Travelling Salesman Problem (TSP) is a well known NP-Hard problem which has broadly been used for modelling many real life routing cases. As a consequence, TSP can be used as a basis for modelling and finding routes for Geographical Systems (GPS). In this paper, we examine the potential use of this method for the GPS system of garbage trucks. Specifically, we provide a thorough presentation of our method accompanied with extensive computational results. The experimental data accumulated on a plethora of symmetric TSP instances (symmetric in order to faithfully simulate GPS problems), which are shown in a series of figures and tables, allow us to conclude that the novel qGVNS algorithm can provide an efficient solution for this type of geographical problems.

Today's unstable labor market increasingly requires flexibility and adaptability to cope with the threat of unemployment. It can cause distress in people and have a more significant negative impact on fragile workers, such as migrants. This study aimed to test whether a Career Counseling intervention designed for Migrants (CCfM) can develop Career Adaptability and, therefore, both Work Self-efficacy (WSe) and Job Search Self-efficacy (JSSe) perceptions. It was conducted in Italy and involved a sample of 233 migrants, who were asked to respond to a questionnaire available in three languages (Italian, French, and English). Data analysis showed that an improvement was demonstrated in all the variables considered, namely career adaptability (including concern, control, confidence, and curiosity), WSe, and JSSe, even though the CCfM was not directly designed to increase the last one. In addition, the development of career adaptability explained the increase in migrants' WSe and JSSe, and the initial level of career adaptability was found to explain the increase in WSe due to the initial positive level of curiosity.

COVID-19 (coronavirus disease 2019) is a public health emergency of international concern caused by Severe Acute Respiratory Syndrome Coronavirus 2 (SARS-CoV-2). As of this time, there is no known effective pharmaceutical, phytopharmaceutical or traditional medicine for cure or prevention of COVID-19, although it is urgently needed. In this review, based on the current understanding of the disease molecular mechanisms of novel Coronavirus SARS-CoV-2 and its closest relative SARS-CoV and other human Coronaviruses, I have identified some naturally occurring plant based substances and Ayurvedic medicinal herbs that could feasibly be tested as a matter of urgency for prevention as well as therapeutic option for COVID-19 in India and other parts of the world. I conclude that dried rhizome of Curcuma longa L. i.e. turmeric, and its active ingredient curcumin may be effective in preventing as well as cure the COVID-19 pandemic due to its proven antiviral activities, this however need to be tested by appropriate clinical trials as research priority.

Beginning with navigation system design, this paper presents a comprehensive strategy for enhancing the search and rescue capabilities of agile mobile robots. Towards this, the autonomous ground vehicle (AGV) utilizes surface classification to determine and prioritize the terrain it is traversing. Our developed system design incorporates real-time terrain data with task objectives at a high level, ensuring that the robot can effectively navigate complex and ever-changing environments. This design, in conjunction with the introduction of a novel lightweight surface classification model, forms the basis of our adaptive terrain perception and decision-making systems, enabling robots such as Jackal to adapt rapidly and make the decisions necessary to complete the task. Subsequently, we exhaustively validated these systems through a series of extensive experiments in a variety of terrains, including normal and mixed terrains, demonstrating their robustness and efficacy in real-life situations.

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

The full impact of COVID-19 on policing, crime and disorder is slowly being fully unraveled. However, there remains a number of areas of policing that are yet to be examined in detail. Two of these areas include the impact on the intrinsically linked, volume of police recorded intelligence reports, and the use of stop and search. In this study we examine them symbiotically and frame them in the context of the intelligence led policing model, in particular in an effort to understand how national lockdowns in the United Kingdom affected both proactive policing approaches and the underpinning intelligence cycle. To achieve this, we use data from freedom of information requests regarding the annual levels of recorded police intelligence over a 10-year period for 20 police services. To supplement this, we examine overall national monthly volumes of stop and search activity over a 5-year period. Finally, we then use a case study approach of 3 police services to further explore changes in the conduct of stop and search such as the officer defined ethnicity, grounds for search and disposal outcomes. The findings indicate that both recorded intelligence reports and stop and search increased dramatically during periods of lockdown, despite widespread decreases in crime and social mobility. Changes in proportional impact are identified for White and Black citizens, searches for controlled drugs and the no further action disposal, but these are not consistent across police services. Potential causes and implications are then discussed and again, framed within the context of the impact on the intelligence led policing model and wider policing environment.

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

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.

Severe cases of SARS-CoV-2 infection are characterized by an immune response that leads to the overproduction of pro-inflammatory cytokines, resulting in damage to the lungs and other organs. This remarkable increase in cytokines and other inflammatory molecules is primary caused by viral proteins, in particular ORF8, a unique accessory protein specific to SARS-CoV-2. In addition to its role in cytokine induction, ORF8 is attributed with various other functions, including its ability to evade type I interferon responses. Despite the evidence, the mechanisms through which ORF8 exerts these functions remains a subject of controversy. In this mini review, we discuss the multifaceted roles of ORF8 as a modulator of cytokine response, focusing on type I interferon and IL-6. We also discuss data from our studies indicating that ORF8 augments production of IL-6 induced by Poly(I:C) in human embryonic kidney (HEK)-293 and monocyte-derived dendritic cells (mono-DCs).

How to disentangle the possible genuine quenching of gA caused by scale anomaly of QCD parameterized by the scale-symmetry-breaking quenching factor qssb from nuclear correlation effects is described. This is done by matching the Fermi-liquid xed (FLFP) point theory to the "Extreme Single Particle (shell) Model" (acronym ESPM) in superallowed Gamow-Teller transitions in heavy doubly-magic shell nuclei. The recently experimentally observed indication for (1-qssb) ≠0 - that one might identify as "fundamental quenching (FQ)" - in certain experiments seems to be alarmingly signi cant. I present arguments how symmetries hidden in the matter-free vacuum can emerge and suppress such FQ in strong nuclear correlations. How to con rm or refute this observation is discussed in terms of the superallowed Gamow-Teller transition in the doubly-magic nucleus 100Sn and in the spectral shape in the multifold forbidden β decay of 115In.

A powder synthesis of PbMoO₄ from ancient lead (Pb) and deeply purified commercial MoO₃ powders was performed using a wet chemistry technique to achieve the low radioactivity scintillator for neutrinoless double beta decay search in ¹⁰⁰Mo. The synthesized powders were used to grow single crystals of PbMoO₄ by a Czochralski technique in Ar environment. The luminescence and scintillation properties were measured with excitations using UV, X- and γ-rays in temperature range of 10-300 K. Annealing of the grown PMO crystal in air atmosphere enhanced the scintillation light yield by ~3 orders of magnitude compared to that measured before annealing. The scintillation light yield of grown PMO crystal at 10 K is found to be 127% to that of a reference PMO crystal under 662 keV γ-rays excitation from a ¹³⁷Cs source. The background measurement of the grown crystal performed at 50 K shows negligible activity from ²¹⁰Pb compared to that of reference PMO crystal. These preliminary performances show that the PMO crystal grown from ancient Pb and deeply purified MoO₃ powders has the great potential to be used as cryogenic scintillator for the neutrinoless double beta decay search in ¹⁰⁰Mo.

The Internet of Medical Things(IoMT) has powerful cloud computing ability and efficient data collection ability, which can improve the accuracy and convenience of medical work. As most communications are over open networks, data should encrypted before uploading to ensure the confidentiality of sensitive user data. Searching for encrypted data has become a challenging problem. Public key Encryption with Keyword Search (PEKS) supports the search of encrypted data and provides data privacy protection. PEKS has become a trendy technology, but PEKS still has the following problems: 1. The cloud server, as a semi-honest but curious third party, is likely to return some wrong search results to save computing and bandwidth resources. 2. The single keyword search inevitably produces irrelevant results, wasting computing and bandwidth resources. 3. Most PEKS schemes use bilinear pairing, so the computational efficiency is relatively low. 4. PEKS schemes based on Public Key Infrastructure (PKI) or identity-based cryptography inevitably face problems with certificate management or key escrow. 5. Most PEKS schemes face serious security threats such as Keyword Guessing Attacks (KGA) and File Injection Attacks (FIA). To solve the above problems, we propose a new certificateless verifiable bilinear pair-free conjunctive keyword search encryption scheme(CLVPFCKS) for IoMT using multi-signature.

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

This paper presents a limited scope dynamic probabilistic risk assessment (D-PRA) on the survivability of commercial of the shelf (COTS) drones tasked with surveilling areas with varying radiation levels after a nuclear accident. The D-PRA is based on a discrete-dynamic event tree (D-DET) approach, which couples with the OpenEPL error propagation framework to model sequences leading to Loss of Mission (LOM) scenarios due to component failures in the drone’s navigation system. Radiation effects are simulated by calculating the total ionizing dose (TID) against the permissible limit per component, and errors are propagated within the electronic hardware and software blocks to quantify navigation system availability per radiation zone. The proposed methods are integrated into the traditional event tree/fault tree approach and the most vulnerable components are radiation-hardened (RAD-HARD) to the extent specified by a predefined mission success criterion. The results demonstrate the usefulness of the proposed approach in performing trade studies for incorporating COTS components into RAD-HARD drone designs.

Continuous Distributed Constraint Optimization Problem (C-DCOPs) are a powerful framework to model problems with continuous variables in multi-agent systems. Previous works about C-DCOP algorithms mainly use pseudo-trees to guarantee the anytime property or are without anytime property guarantees. However, there is a risk of privacy leakage in the pseudo-tree due to utility passing between agents. Therefore, based on the basic constraint graph instead of the pseudo-tree, we (i) extend the Maximum Gain Message (MGM) algorithm by combining the local search strategy to solve C-DCOPs, named Continuous MGM (C-MGM), and it’s able to guarantee the monotonicity of the solution quality; (ii) propose a Parallel C-MGM (C-PMGM) algorithm to improve the solution quality through parallel random search; and (iii) introduce the differential search into C-PMGM to design a Parallel Differential Search C-MGM (C-PDSM) algorithm, which constructs a heuristic method to speed up convergence and improve solution quality. Compared to other anytime C-DCOP algorithms using pseudo-trees, the proposed three algorithms can exhibit better performance in avoiding privacy violations. We theoretically prove that the proposed algorithms are the anytime algorithms and empirically demonstrate that our algorithms outperform the state-of-the-art C-DCOP algorithms.

The World Health Organization (WHO) added Disease X to their shortlist of blueprint priority diseases to represent a hypothetical, unknown pathogen that could cause a future epidemic. During different virus outbreaks of the past, such as COVID-19, Influenza, Lyme Disease, and Zika virus, researchers from various disciplines utilized Google Trends to mine multimodal components of web behavior to study, investigate, and analyze the global awareness, preparedness, and response associated with these respective virus outbreaks. As the world prepares for Disease X, a dataset on web behavior related to Disease X would be crucial to contribute towards the timely advancement of research in this field. Furthermore, none of the prior works in this field have focused on the development of a dataset to compile relevant web behavior data, which would help to prepare for Disease X. To address these research challenges, this work presents a dataset of web behavior related to Disease X, which emerged from different geographic regions of the world, between February 2018 to August 2023. Specifically, this dataset presents the search interests related to Disease X from 94 geographic regions. These regions were chosen for data mining as these regions recorded significant search interests related to Disease X during this timeframe. The dataset was developed by collecting data using Google Trends. The relevant search interests for all these regions for each month in this time range are available in this dataset. This paper also discusses the compliance of this dataset with the FAIR principles of scientific data management. Finally, a brief analysis of specific features of this dataset is presented to uphold the applicability, relevance, and usefulness of this dataset for the investigation of different research questions in the interrelated fields of Big Data, Data Mining, Healthcare, Epidemiology, and Data Analysis.

This paper seeks to explore some of the issues to be welcomed but also warned against in general but also specified from an illustrative sample of ‘smart’ projects that caused outcomes that were neither ‘smart’ nor ‘resilient’. These give pointers to a ‘thirdspace’ as a descriptor of the most advanced application of sustainability thinking regarding relational spatial development planning. This contribution examines difficulties in delivering both ‘smart’ and ‘resilient’ responses of interest or value to citizens confronted with recurring crises that derive directly or with implications for sustainability issues. Identified are constraints and issues acting as obstacles to governance, management ‘layering’ and ‘learning’ causing failures of many weak or never-delivered projects. Critiques of static, or worse ‘magical’ thinking are increasingly invoked in consequence. In the analysis of ‘live cases’ all these problems showed up ‘in real life’. The author was pleased that his mentor, the late UCLA planning theorist Ed Soja’s application of the idea of ‘Thirdspace’ received prescient vindication from the results of this adjudication.

In this work, we explore the extreme searching of multidimensional functions by natural gradient descent based on Dirichlet and generalized Dirichlet distributions. The natural gradient is based on describing multidimensional surface with probability distributions, which allows us to reduce changing the accuracy of gradient and step-size. In this article, we propose an algorithm of natural gradient descent based on Dirichlet and generalized Dirichlet distributions. We demonstrate that the natural gradient descent with step-size adaptation with Dirichlet and generalized Dirichlet distributions has higher accuracy and does not take a large number of iterations for minimizing test functions than gradient descent and Adam.

Metaheuristic algorithms are widely used as optimization methods, due to their global exploration and exploitation characteristics, which obtain better results than a simple heuristic. The Stochastic Fractal Search (SFS) is a novel method inspired by the process of stochastic growth in nature and the use of the fractal mathematical concept. Considering the chaotic-stochastic diffusion property, an improved Dynamic Stochastic Fractal Search (DSFS) optimization algorithm is presented. The DSFS algorithm was tested with benchmark functions, such as the multimodal, hybrid and composite functions, to evaluate the performance of the algorithm with dynamic parameter adaptation with type-1 and type-2 fuzzy inference models. The main contribution of the article is the utilization of fuzzy logic in the adaptation of the diffusion parameter in a dynamic fashion. This parameter is in charge of creating new fractal particles, and the diversity and iteration are the input information used in the fuzzy system to control the values of diffusion.

Considering the significant advancements in autonomous vehicle technology, research in this field is of interest to researchers. To automatic parking, controlling steer angle, gas hatch, and brakes need to be learned. Due to the increase in the number of cars and road traffic, car parking space has decreased. Its main reason is information error. Because the driver does not receive the necessary information or receives it too late, he cannot take appropriate action against it. This paper uses two phases: the first phase, for goal coordination, was used genetic algorithms and the Cuckoo search algorithm was used to increase driver information from the surroundings. Using the Cuckoo search algorithm and considering the limitations, it increases the driver’s level of information from the environment. Also, by exchanging information through the application, it enables the information to reach the driver much more quickly and the driver reacts appropriately at the right time. The suggested protocol is called the MODM-based solution. Here, the technique is assessed through extensive simulations performed in the NS-3 environment. Based on the simulation outcomes, it is indicated that the parking system performance metrics are enhanced based on the detection rate, false-negative rate, and false-positive rate.

The prerogative to narrate the experience of marginal identities, particularly ethno-religious ones, appeared only in the post-occupation era in Iraqi fiction. Traditionally, secular Iraqi discourse struggled to openly address “sectarianism” due to the prevalent notion that sectarian identities are mutually exclusive and oppositional to national identity. It is distinctly in post-2003 Iraq—more precisely, since the sectarian violence of 2006–2007 began to cut across class, civil society, and urban identities—that works which consciously refuse to depict normative Iraqi identities with their mainstream formulations become noticeable. We witness this development first in the Western diaspora, where Iraqi novels exhibit a fascination with the ethno-religious culture of the Iraqi margins or subalterns and impart a message of pluralistic secularism. This paper investigates the origins of the taboo that proscribed articulations of ethno-religious subjectivities in 20^th-century Iraqi fiction, and then culls examples of recent diasporic Iraqi novels in which these subjectivities are encoded and amplified in distinct ways. In the diasporic novel, I argue, modern Iraqi intellectuals attain the conceptual and political distance necessary for contending retrospectively with their formative socialization experiences in Iraq. Through a new medium of marginalization—the diasporic experience of the authors themselves—they are equipped with a newfound desire to unmask subcultures in Iraq and to write more effectively about marginal aspects of Iraqi identity inside and outside the country. These new diasporic writings showcase processes of ethnic and religious socialization in the Iraqi public sphere. The result is deconstruction of mainstream Iraqi identity narratives and instrumentalization of marginal identities in a nonviolent struggle against sectarian violence.

ABSTRACT Background It is important to be able to predict, for each individual patient, the likelihood of later metastatic occurrence, because the prediction can guide treatment plans tailored to a specific patient to prevent metastasis and to help avoid under- or over-treatment. Deep Neural Network (DNN) learning, commonly referred to as deep learning, has become popular due to its success in image detection and prediction, but questions such as whether deep learning outperforms other machine learning methods when using non-image clinical data remain unanswered. Grid search has been introduced to deep learning hyperparameter tunning for the purpose of improving its prediction performance, but the effect of grid search on other machine learning methods are under-studied. In this research, we take the empirical approach to study the performance of deep learning and other machine learning methods when using non-image clinical data to predict the occurrence of breast cancer metastasis (BCM) 5, 10, or 15-years after the initial treatment. We developed DNN models as well as models using 9 other machine learning methods including Naive Bayes (NB), Logistic Regression (LR), Support Vector Machine (SVM), LASSO, Decision Tree (DT), k-Nearest Neighbors (KNN), Random Forrest (RF), AdaBoost (ADB), and XGBoost (XGB). We used grid search to tune hyperparameters for all methods. We then compared the deep learning models to the models trained using the 9 other machine learning methods. Results Based on the mean test AUC results, DNN ranks 6th, 4th, and 3rd when predicting 5-year, 10-year, and 15-year BCM respectively, out of 10 machine learning methods. The top performing methods in predicting 5-year BCM are XGB(1^st), RF(2^nd), and KNN(3^rd). For predicting 10-year BCM the top performers are XGB (1^st), RF(2^nd), and NB(3^rd) . Finally, for 15-year BCM the top performers are SVM (1^st), LR and LASSO (tied for 2^nd), and DNN (3^rd). The ensemble methods RF and XGB outperform other methods when data are less balanced, while SVM, LR, LASSO, and DNN outperform other methods when data are more balanced. Our statistical testing results show that at a significance level of 0.05 DNN overall performs no worse than other machine learning methods when predicting 5-year, 10-year, and 15-year BCM. Conclusions Our results show that deep learning with grid search overall performs at least as well as other machine learning methods when using non-image clinical data. It is interesting to note that some of the other machine learning methods such as XGB, RF, and SVM are very strong competitors of DNN when incorporating grid search. It is also worth noting that the computation time required to do grid search with DNN is way more than that required to do grid search with the other 9 machine learning methods.

Rapid eye movement sleep behavior disorder (RBD) is often prodromal to Parkinson’s disease (PD). Thus there should be detectable in vivo functional signatures shared between RBD and PD that aid in disease classification. To assess common in-vivo phenotypes, resting state data was collected on a 3T clinical MRI platform and a novel functional connectivity magnetic resonance imaging (fcMRI) approach, which combined independent component analysis (ICA) and graph theory, was used to evaluate deficits in interconnectivity among 15 PD, 14 RBD and 13 control participants. Whole brain and network-level analyses revealed the largest deficits in network connectivity in PD compared with controls, with less severe differences between RBD and controls. Importantly, the network-level analysis demonstrated decreased network interconnectivity, with the greatest aberrant networks in PD, and a subset in RBD. Additionally, a disease classification algorithm predicted PD cases by being trained on RBD cases with 0.87 sensitivity and 0.68 specificity. The functional alterations in cortical networks in RBD extended beyond the brainstem. These findings demonstrate progressive reductions in connectivity between brain networks, with less severe deficits in RBD than PD. Moreover, RBD phenotypes can be used to predict PD status in a cross-sectional sample, which suggests RBD is an intermediate phenotype.

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

The PAX8/PPARγ rearrangement, producing the PAX8–PPARγ fusion protein (PPFP), is thought to play an essential role in the oncogenesis of thyroid follicular tumors. To identify PPFP-targeted drug candidates and establish an early standard of care for thyroid tumors, we performed ensemble docking-based compound screening. Specifically, we investigated which pocket structure should be adopted to search for a promising ligand compound for the PPFP; the position of the ligand binding pocket on the PPARγ side of the PPFP is common to that of PPARγ; however, the shape is slightly different between them due to environmental factors. We developed a method for selecting a PPFP structure with a relevant pocket and high prediction accuracy for ligand binding. This method was validated using PPARγ, whose structure and activity values are known for many compounds. Then, we performed docking calculations to PPFP for 97 drug or drug-like compounds with a thiazolidine backbone, which is one of the characteristics of ligands that bind well to PPARγ, registered in the DrugBank database. Furthermore, the binding affinities of promising ligand candidates were estimated more reliably using the molecular mechanics-Poisson–Boltzmann surface area method. Thus, we propose promising drug candidates for the PPFP with a thiazolidine backbone.

Swarm intelligence (SI) methods are nature-inspired metaheuristics for global optimization that exploit a coordinated stochastic search strategy by a group of agents. Particle Swarm Optimization (PSO) is an established SI method that has been applied successfully to the optimization of rugged high-dimensional likelihood functions, a problem that presents the main bottleneck across a variety of gravitational wave (GW) data analysis challenges. We present results from a first application of PSO to one of the most difficult of these challenges, namely, the search for Extreme Mass Ratio Inspiral (EMRI) in data from future spaceborne GW detectors such as LISA, Taiji, or Tianqin. We use the standard Generalized Likelihood Ratio Test formalism, with minimal use of restrictive approximations, to search 6 months of simulated LISA data and quantify the search depth, in signal-to-noise ratio (SNR), and breadth, in the ranges of the EMRI parameters, that PSO can handle. Our results demonstrate that a PSO-based EMRI search is successful over a search region that is in the ballpark of the one that current hierarchical schemes can identify. Directions for future improvements, including computational bottlenecks to be overcome, are identified.

Voice search technology has gained popularity in recent years, transforming the way individuals interact with digital devices. This study aims to explore the sustainable use intention of voice search, focusing on the psychological factors that influence new technology adoption. Using the Technology Acceptance Model (TAM) and anthropomorphism theory, it provides insights for developers, marketers, and policymakers interested in voice search technology. Through an online survey targeting experienced voice search users in the U.S., the study examines the impact of TAM factors (perceived usefulness, ease of use, quality satisfaction) and anthropomorphism traits (narcissism, Machiavellianism) on sustainable use intention of voice search. Results from hierarchical regression analysis show that perceived usefulness, ease of use, and quality satisfaction positively affect sustainable intention of voice search. Additionally, narcissism and Machiavellianism predict sustainable intention of voice search. By merging TAM and anthropomorphism theory, this study enhances our understanding of voice search behavior and technology adoption.

This paper presents a cooperative parallel tabu search meta-heuristic for the vehicle routing problem with time windows. It is based on the scheme in which several search threads cooperate by asynchronously exchanging information on the best solutions identified. The exchanges are performed through a mechanism called adaptive memory which holds and manages a pool of solutions. This enforces the asynchronous strategy of information exchanges and ensures the independence of the individual search threads. Each of these independent threads implements a tabu search meta-heuristic. Comprehensive computational experiments and comparisons to best known solutions show that the proposed cooperative parallel tabu search algorithm is able to achieve 48 new best solutions on VRPTW benchmark instances.

This article investigates the information matching efficiency of the sponsored auction mechanism of search engine platform by implementing consumer purchase strategy. Then we examine the incentive mechanism for sellers to report product quality truthfully under information asymmetry and the reason how product quality signal could improve information matching efficiency of the sponsored auction mechanism. Using the data collected from Baidu search engine, we empirically test the theoretical research results. Our main research finding: under information asymmetry and without product quality signal mechanism, the equilibrium of bidding rank cannot match the consumer purchase strategy at all, causing the consumer welfare to suffer double losses due to the adverse selection of sellers. In the contrast, the search engine could improve partially the information matching efficiency of the sponsored search auction mechanism by identifying the product quality signal brought by the sellers with the highest product quality. However, the search engine has no incentive to design product quality signal for sellers.

The purpose of our work was the search for safe and effective biologically active substances of cardiotropic action among 1,3- thiazole derivatives. New derivatives of 1-[(2Z)-2-[R-imin]-4-methyl-3-R¹-2,3-dihydro-1,3-thiazole-5-yl]ethan-1-one and ethyl-(2Z)-2-[R-imin]-4-methyl-3-R¹-2,3-dihydro-1,3-thiazole-5-carboxylate were synthesized by the Hantzsch reaction. The structure of the compounds obtained was confirmed by ¹H NMR spectroscopy and by the elemental analysis. The pharmacological screening showed that the obtained substances possess cardiotropic activity. The cardiotropic properties of the new 1,3-thiazole derivatives were studied on the isolated rings of the thoracic aorta of laboratory rats. A prospective substance 1-[(2Z)-2-[(4-methoxyphenyl)imin]-4-methyl-3-(4-methylpiperazin-1-yl) -2,3-dihydro-1,3-thiazol-5-yl]ethan-1-one hydrochloride, which exhibits cardiotropic activity exceeding the activity of L-carnitine and meldonia has been revealed during pharmacological researches of the substances obtained.

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

In patients with presumed pancreatic ductal adenocarcinoma (PDAC), biomarkers that may open for personalised, risk-adapted treatment are lacking. The study analysed the impact of circulating tumour cells (CTCs) on the patterns of recurrence and survival in 98 patients resected for PDAC with 5-10 years of follow-up. Preoperative samples were analysed by the CellSearch® system for EpCAM+/DAPI+/CK+/CD45- CTCs. CTCs were detected in 7 of the 98 patients. CTCs predicted a significantly shorter median DFS of 3.3 vs. 9.2 months and a median CSS of 6.3 vs. 18.5 months. Relapse status was confirmed by imaging for 87 patients. Of these, 58 developed distant metastases (DM) and 29 cases isolated local recurrence (ILR) as first event. All patients with CTCs experienced DM. pN-status and histological grade &gt;2 were other independent risk factors for DM, but only CTCs predicted significantly shorter cancer-specific, disease-free and post-recurrence survival. We conclude that CTC presence in resected PDAC patients predicted early distant metastasis and impaired survival. The impact of CTCs was comparable to that of histopathological risk factors and exceeded the effect size of other preoperative parameters. Thus, preoperative CTCs alone or in combination with histopathological factors may guide initial treatment decisions in patients with resectable PDAC in the future.

An imbalance between production and excretion of amyloid β peptide (Aβ) in the brain tissues of Alzheimer’s disease (AD) patients leads to Aβ accumulation and formation of noxious Aβ oligomers/plaques. A promising approach to AD prevention is reduction of free Aβ level by directed enhancement of Aβ binding to its natural depot, human serum albumin (HSA). We previously demonstrated the ability of specific low-molecular-weight ligands (LMWLs) of HSA to improve its affinity for Aβ. Here we develop this approach by bioinformatic search for the clinically approved AD-related LMWLs of HSA, followed by classification of the candidates according to the predicted location of their binding sites on HSA surface, ranking of the candidates, and selective experimental validation of their impact on HSA affinity for Aβ. The top 100 candidate LMWLs were classified into the five clusters. The specific representatives of the different clusters exhibit dramatically different behavior, with 3- to 13-fold changes in equilibrium dissociation constants for the HSA-Aβ40 interaction: prednisone favors HSA-Aβ interaction, mefenamic acid shows the opposite effect, while levothyroxine exhibits the bidirectional effects. Overall, the LMWLs of HSA chosen here provide a basis for drug repurposing for AD prevention, and for search for the medications promoting AD progression.

Sideroflexins (SFXN) are evolutionarily conserved mitochondrial carriers belonging to the SCL56 family. Until recently, the metabolites transported by SFXN were unknown and they were thought to be transporters of a metabolite involved in iron homeostasis. SFXN1 is now known as the mitochondrial serine transporter. Because little is known about SFXN1 interactome, we launched a high-throughput search of SFXN1 binding partners with the aim to better understand its mitochondrial functions. Using a large-scale identification of SFXN1 physical partners based on co-immunoprecipitation followed by shotgun mass spectrometry (coIP-MS), we identified 96 putative SFXN1 interactants in the MCF7 human cell line. Our in-silico analysis of the SFXN1 interactome highlights biological processes linked to mitochondrial organization, electron transport chain and transmembrane transport. Among SFXN1 potential physical partners, ATAD3A and 17-HSD10, two proteins associated with neurological disorders and neurodegeneration, were further confirmed as interactants using different human cell lines. Further work will be needed to investigate the significance of these interactions in neurological disorders.

A clear relationship between the tau assemblies and toxicity has still to be established. To correlate the tau conformation with its proteotoxic effect in vivo we developed an innovative cell-worm-based approach. HEK293 cells expressing tau P301L under a tetracycline-inducible system (HEK T-Rex) were employed to produce different tau assemblies whose proteotoxic potential was evaluated using C. elegans. Lysates from cells induced for five days, significantly reduced the worm’s locomotor activity. This toxic effect was not related to the total amount of tau produced by cells or to its phosphorylation state but was related to the formation of multimeric tau assemblies, particularly tetrameric ones. We investigated the applicability of this approach for testing compounds acting against oligomeric tau toxicity, using doxycycline (Doxy) as prototype drug. Doxy affected the tau solubility and promoted the disassembly of already formed toxic aggregates in lysates of cells induced for five days. These effects translated into a dose-dependent protective action in C. elegans. These findings confirm the validity of the combined HEK T-Rex cells and C. elegans-based approach as a platform for pharmacological screening.

The peril of a 3-dimensional, robust and sustained myocardial restoration by means of Tissue Engineering is that it still remains a largely experimental approach. Prolific protocols have been developed and tested in small and large animals, but as clinical cardiac surgeons, we have not come to the privilege of utilizing any of them in our clinical practice. The question arises: why? The heart is a unique organ, anatomically and functionally. It is not an easy target to replicate with current techniques, or even to support its viability and function. Currently available therapies fail to reverse the loss of functional cardiac tissue, the fundamental pathology remains unaddressed and a heart transplantation is an ultima ratio treatment option. Owing to equivocal results of cell-based therapies, several strategies have been pursued to overcome limitations of the current treatment options. Preclinical data as well as first-in-human studies conducted to date have provided important insights into the understanding of injection-based approaches for myocardial restoration. In the light of the available data, injectable biomaterials suitable for transcatheteter delivery appear to have the highest translational potential,. This article presents a current state-of-the-art in the field of hydrogel-based myocardial restoration therapy.

The purpose of our study is to research Peter’s memory ad catacumbas. According to the Depositio Martyrum ‒ a document of the late Emperor Constantine ‒, there was no memory of the first St Peter’s Basilica on the Vatican Hill. We start with a critical analysis on the Roman Basilicae attributed to Emperor Constantine in the Liber Pontificalis, then we deepen the search of Peter’s memory in the catacombs of the SS Marcellino and Pietro (ad Duos Lauros), also known as Tor Pignattara. Indeed, the Basilica and Mausoleum built in this cemeterial area are the only buildings attributable, with certainty, to Emperor Constantine, who wished to be buried in the Mausoleum, close to an apostle. Besides some striking archeological finds on Peter’s memory already discovered near a particular cubicle in these catacombs, a geometrical and mathematical study of the unusual architectonic characteristics of the Basilica and Mausoleum of Tor Pignattara shows that the buildings were part of a single architectonic plan, very likely designed for coding data useful to locate Peter’s burial site unambiguously, in the area of the cubicle mentioned.

Software is playing the most important role in recent vehicle innovation, and consequently the amount of software has been rapidly growing last decades. Safety-critical nature of ships, one sort of vehicles, makes Software Quality Assurance (SQA) has gotten to be a fundamental prerequisite. Just-In-Time Software Defect Prediction (JIT-SDP) aims to conduct software defect prediction (SDP) on commit-level code changes to achieve effective SQA resource allocation. The first case study of SDP in maritime domain reported feasible prediction performance. However, we still consider that the prediction model has still rooms for improvement since the parameters of the model are not optimized yet. Harmony Search (HS) is a widely used music-inspired meta-heuristic optimization algorithm. In this article, we demonstrated that JIT-SDP can produce the better performance of prediction by applying HS-based parameter optimization with balanced fitness value. Using two real-world datasets from the maritime software project, we obtained an optimized model that meets the performance criterion beyond baseline of previous case study throughout various defect to non-defect class imbalance ratio of datasets. Experiments with open source software also showed better recall for all datasets despite we considered balance as performance index. HS-based parameter optimized JIT-SDP can be applied to the maritime domain software with high class imbalance ratio. Finally, we expect that our research can be extended to improve performance of JIT-SDP not only in maritime domain software but also in open source software.

The capacitated team orienteering problem with time windows (CTOPTW) is a NP-hard combinatorial optimization problem. In the CTOPTW, a set of customers is given each with a profit, a demand, a service time and a time window. A homogeneous fleet of vehicles is available for serving customers and collecting their associated profits. Each vehicle is constrained by a maximum tour duration and a limited capacity. The CTOPTW is concerned with the determination of a preset number of vehicle tours that begin and end at a depot, visit each customer no more than once while satisfying the time duration, time window and vehicle capacity constraints on each tour. The objective is to maximize the total profit collected. In this study we propose an iterated local search (ILS) algorithm to deal with the CTOPTW. ILS is a single solution based meta-heuristic that successively invokes a local search procedure to explore the solution space. A perturbation operator is used to modify the current local optimum solution in order to provide a starting solution for the local search procedure. As different problems and instances have different characteristics, the success of the ILS is highly dependent on the local search procedure, the perturbation operator(s) and the perturbation strength. The basic ILS uses a single perturbation operator and the perturbation strength remains the same during the optimization process. To address these issues, we use three different perturbation operators and a varying perturbation strength which changes as the algorithm progresses. The idea is to assign a larger perturbation strength in the early stages of the search in order to focus on exploring the search space. The perturbation strength is gradually decreased so that we focus more on exploitation. The computational results show that the proposed ILS algorithm is able to generate high quality solutions on the CTOPTW benchmark instances taken from the scientific literature, demonstrating its efficiency in terms of both the solution quality and computational time. Moreover, the proposed ILS produces 21 best known results and 5 new best solutions.

In recent decades, attention has been directed at anemia classification for various medical purposes, such as thalassemia screening and predicting iron deficiency anemia (IDA). In this study, a new method has been successfully tested for discrimination between IDA and β-thalassemia trait (β-TT). The method is based on a Dynamic Harmony Search (DHS). Complete blood count (CBC), a fast and inexpensive laboratory test, is used as the input of the system. Other models, such as a genetic programming method called structured representation on genetic algorithm in non-linear function fitting (STROGANOFF), an artificial neural network (ANN), an adaptive neuro-fuzzy inference system (ANFIS), a support vector machine (SVM), k-nearest neighbor (KNN), and certain traditional methods, are compared with the proposed method.

Automatic recognition methods for non-stationary EEG data collected from EEG sensors play an essential role in neurological detection. The integrative approaches proposed in this study consists of Symlet wavelet processing, a gradient boosting machine, and a grid search optimizer for a three-level classification scheme for normal subjects, intermittent epilepsy, and continuous epilepsy. Fourth-order Symlet wavelets were adopted to decompose the EEG data into five time-frequency sub-bands, whose statistical features were computed and used as classification features. The grid search optimizer was used to automatically find the optimal parameters for training the classifier. The classification accuracy of the gradient boosting machine was compared with that of a support vector machine and a random forest classifier constructed according to previous descriptions. Multiple-index were used to evaluate the Symlet wavelet transform-gradient boosting machine-grid search optimizer classification scheme, which provided better classification accuracy and detection effectiveness than has recently reported in other work on three-level classification of EEG data.