Automatic configuration of the Cassandra database using irace.
Ontology highlight
ABSTRACT:
SUBMITTER: Silva-Munoz M
PROVIDER: S-EPMC8356662 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Many epidemiological models and algorithms are used to fit the parameters of a given epidemic curve. On many occasions, fitting algorithms are interleaved with the actual epidemic models, which yields combinations of model-parameters that are hard to compare among themselves. Here, we provide a model-agnostic framework for epidemic parameter fitting that can (fairly) compare different epidemic models without jeopardizing the quality of the fitted parameters. Briefly, we have developed a Python framework that expects a Python function (epidemic model) and epidemic data and performs parameter fitting using automatic configuration. Our framework is capable of fitting parameters for any type of epidemic model, as long as it is provided as a Python function (or even in a different programming language). Moreover, we provide the code for different types of models, as well as the implementation of 4 concrete models with data to fit them. Documentation, code and examples can be found at https://ulog.udl.cat/static/doc/epidemic-gga/html/index.html .
| S-EPMC10774272 | biostudies-literature
Project description:Breast cancer becomes the second major cause of death among women cancer patients worldwide. Based on research conducted in 2019, there are approximately 250,000 women across the United States diagnosed with invasive breast cancer each year. The prevention of breast cancer remains a challenge in the current world as the growth of breast cancer cells is a multistep process that involves multiple cell types. Early diagnosis and detection of breast cancer are among the greatest approaches to preventing cancer from spreading and increasing the survival rate. For more accurate and fast detection of breast cancer disease, automatic diagnostic methods are applied to conduct the breast cancer diagnosis. This paper proposed the fuzzy-ID3 (FID3) algorithm, a fuzzy decision tree as the classification method in breast cancer detection. This study aims to resolve the limitation of an existing method, ID3 algorithm that unable to classify the continuous-valued data and increase the classification accuracy of the decision tree. FID3 algorithm combined the fuzzy system and decision tree techniques with ID3 algorithm as the decision tree learning. FUZZYDBD method, an automatic fuzzy database definition method, would be used to design the fuzzy database for fuzzification of data in the FID3 algorithm. It was used to generate a predefined fuzzy database before the generation of the fuzzy rule base. The fuzzified dataset was applied in FID3 algorithm, which is the fuzzy version of the ID3 algorithm. The inference system of FID3 algorithm is simple with direct extraction of rules from generated tree to determine the classes for the new input instances. This study also analysed the results using three breast cancer datasets: WBCD (Original), WDBC (Diagnostic) and Coimbra. Furthermore, the comparison of FID3 algorithm with the existing methods is conducted to verify the proposed method's capability and performance. This study identified that the combination of FID3 algorithm with FUZZYDBD method is reliable, robust and managed to perform well in breast cancer classification.
| S-EPMC8114800 | biostudies-literature
Project description:We report a group of TRIMs (terminal-repeat retrotransposons in miniature), which are small nonautonomous retrotransposons. These elements, named Cassandra, universally carry conserved 5S RNA sequences and associated RNA polymerase (pol) III promoters and terminators in their long terminal repeats (LTRs). They were found in all vascular plants investigated. Uniquely for LTR retrotransposons, Cassandra produces noncapped, polyadenylated transcripts from the 5S pol III promoter. Capped, read-through transcripts containing Cassandra sequences can also be detected in RNA and in EST databases. The predicted Cassandra RNA 5S secondary structures resemble those for cellular 5S rRNA, with high information content specifically in the pol III promoter region. Genic integration sites are common for Cassandra, an unusual feature for abundant retrotransposons. The 5S in each LTR produces a tandem 5S arrangement with an inter-5S spacing resembling that of cellular 5S. The distribution of 5S genes is very variable in flowering plants and may be partially explained by Cassandra activity. Cassandra thus appears both to have adapted a ubiquitous cellular gene for ribosomal RNA for use as a promoter and to parasitize an as-yet-unidentified group of retrotransposons for the proteins needed in its lifecycle.
| S-EPMC2311327 | biostudies-literature
Project description:Constraint-based models use steady-state mass balances to define a solution space of flux configurations, which can be narrowed down by measuring as many fluxes as possible. Due to loops and redundant pathways, this process typically yields multiple alternative solutions. To address this ambiguity, flux sampling can estimate the probability distribution of each flux, or a flux configuration can be singled out by further minimizing the sum of fluxes according to the assumption that cellular metabolism favors states where enzyme-related costs are economized. However, flux sampling is susceptible to artifacts introduced by thermodynamically infeasible cycles and is it not clear if the economy of fluxes assumption (EFA) is universally valid. Here, we formulated a constraint-based approach, MaxEnt, based on the principle of maximum entropy, which in this context states that if more than one flux configuration is consistent with a set of experimentally measured fluxes, then the one with the minimum amount of unwarranted assumptions corresponds to the best estimation of the non-observed fluxes. We compared MaxEnt predictions to Escherichia coli and Saccharomyces cerevisiae publicly available flux data. We found that the mean square error (MSE) between experimental and predicted fluxes by MaxEnt and EFA-based methods are three orders of magnitude lower than the median of 1,350,000 MSE values obtained using flux sampling. However, only MaxEnt and flux sampling correctly predicted flux through E. coli's glyoxylate cycle, whereas EFA-based methods, in general, predict no flux cycles. We also tested MaxEnt predictions at increasing levels of overflow metabolism. We found that MaxEnt accuracy is not affected by overflow metabolism levels, whereas the EFA-based methods show a decreasing performance. These results suggest that MaxEnt is less sensitive than flux sampling to artifacts introduced by thermodynamically infeasible cycles and that its predictions are less susceptible to overfitting than EFA-based methods.
| S-EPMC7717585 | biostudies-literature
Project description:Study objectivesDevelopment of inter-database generalizable sleep staging algorithms represents a challenge due to increased data variability across different datasets. Sharing data between different centers is also a problem due to potential restrictions due to patient privacy protection. In this work, we describe a new deep learning approach for automatic sleep staging, and address its generalization capabilities on a wide range of public sleep staging databases. We also examine the suitability of a novel approach that uses an ensemble of individual local models and evaluate its impact on the resulting inter-database generalization performance.MethodsA general deep learning network architecture for automatic sleep staging is presented. Different preprocessing and architectural variant options are tested. The resulting prediction capabilities are evaluated and compared on a heterogeneous collection of six public sleep staging datasets. Validation is carried out in the context of independent local and external dataset generalization scenarios.ResultsBest results were achieved using the CNN_LSTM_5 neural network variant. Average prediction capabilities on independent local testing sets achieved 0.80 kappa score. When individual local models predict data from external datasets, average kappa score decreases to 0.54. Using the proposed ensemble-based approach, average kappa performance on the external dataset prediction scenario increases to 0.62. To our knowledge this is the largest study by the number of datasets so far on validating the generalization capabilities of an automatic sleep staging algorithm using external databases.ConclusionsValidation results show good general performance of our method, as compared with the expected levels of human agreement, as well as to state-of-the-art automatic sleep staging methods. The proposed ensemble-based approach enables flexible and scalable design, allowing dynamic integration of local models into the final ensemble, preserving data locality, and increasing generalization capabilities of the resulting system at the same time.
| S-EPMC8366993 | biostudies-literature
Project description:PURPOSE:In automated treatment planning, configuration of the underlying algorithm to generate high-quality plans for all patients of a particular tumor type can be a major challenge. Often, a time-consuming trial-and-error tuning procedure is required. The purpose of this paper is to automatically configure an automated treatment planning algorithm for oropharyngeal cancer patients. METHODS:Recently, we proposed a new procedure to automatically configure the reference point method (RPM), a fast automatic multi-objective treatment planning algorithm. With a well-tuned configuration, the RPM generates a single Pareto optimal treatment plan with clinically favorable trade-offs for each patient. The automatic configuration of the RPM requires a set of computed tomography (CT) scans with corresponding dose distributions for training. Previously, we demonstrated for prostate cancer planning with 12 objectives that training with only 9 patients resulted in high-quality configurations. This paper further develops and explores the new automatic RPM configuration procedure for head and neck cancer planning with 22 objectives. Investigations were performed with planning CT scans of 105 previously treated unilateral or bilateral oropharyngeal cancer patients together with corresponding Pareto optimal treatment plans. These plans were generated with our clinically applied two-phase ?-constraint method (Erasmus-iCycle) for automated multi-objective treatment planning, ensuring consistent high quality and Pareto optimality of all plans. Clinically relevant, nonconvex criteria, such as dose-volume parameters and NTCPs, were included to steer the RPM configuration. RESULTS:Training sets with 20-50 patients were investigated. Even with 20 training plans, high-quality configurations of the RPM were feasible. Automated plan generation with the automatically configured RPM resulted in Pareto optimal plans with overall similar or better quality than that of the Pareto optimal database plans. CONCLUSIONS:Automatic configuration of the RPM for automated treatment planning is feasible and drastically reduces the time and workload required when compared to manual tuning of an automated treatment planning algorithm.
| S-EPMC7216905 | biostudies-literature
Project description:A new method was developed to assign the absolute configuration of molecules using kinetic resolution catalysts. Secondary alcohols were acylated in the presence of Birman's S-HBTM and R-HBTM catalysts, and the fast-reacting catalyst was identified by NMR analysis of the reaction mixture. A mnemonic was developed to assign configuration based on the identity of the fast-reacting catalyst. The method uses only 1-3 mg of alcohol, and it is more convenient than the Mosher method. The kinetic resolution strategy may be extended to other classes of molecules.
| S-EPMC3179685 | biostudies-literature
Project description:Competent data mining methods are vital to discover knowledge from databases which are built as a result of enormous growth of data. Various techniques of data mining are applied to obtain knowledge from these databases. Data clustering is one such descriptive data mining technique which guides in partitioning data objects into disjoint segments. K-means algorithm is a versatile algorithm among the various approaches used in data clustering. The algorithm and its diverse adaptation methods suffer certain problems in their performance. To overcome these issues a superlative algorithm has been proposed in this paper to perform data clustering. The specific feature of the proposed algorithm is discretizing the dataset, thereby improving the accuracy of clustering, and also adopting the binary search initialization method to generate cluster centroids. The generated centroids are fed as input to K-means approach which iteratively segments the data objects into respective clusters. The clustered results are measured for accuracy and validity. Experiments conducted by testing the approach on datasets from the UC Irvine Machine Learning Repository evidently show that the accuracy and validity measure is higher than the other two approaches, namely, simple K-means and Binary Search method. Thus, the proposed approach proves that discretization process will improve the efficacy of descriptive data mining tasks.
| S-EPMC4620246 | biostudies-other
Project description:Acoustic holograms are the keystone of modern acoustics. They encode three-dimensional acoustic fields in two dimensions, and their quality determines the performance of acoustic systems. Optimisation methods that control only the phase of an acoustic wave are considered inferior to methods that control both the amplitude and phase of the wave. In this paper, we present Diff-PAT, an acoustic hologram optimisation platform with automatic differentiation. We show that in the most fundamental case of optimizing the output amplitude to match the target amplitude; our method with only phase modulation achieves better performance than conventional algorithm with both amplitude and phase modulation. The performance of Diff-PAT was evaluated by randomly generating 1000 sets of up to 32 control points for single-sided arrays and single-axis arrays. This optimisation platform for acoustic hologram can be used in a wide range of applications of PATs without introducing any changes to existing systems that control the PATs. In addition, we applied Diff-PAT to a phase plate and achieved an increase of > 8 dB in the peak noise-to-signal ratio of the acoustic hologram.
| S-EPMC8209099 | biostudies-literature
Project description:In the title compound, C(24)H(25)N(5)O(4), the stereogenic C atom bonded to three N atoms and one C atom has an S configuration and its directly bonded neighbour has an R configuration. An intra-molecular N-H?O hydrogen bond supports the near coplanarity of the two C(3)N(2)-five-membered rings [dihedral angle = 5.64?(10)°]. In the crystal, mol-ecules are linked by N-H?N hydrogen bonds, forming a C(8) chain propagating in [001]. The chains are connected by C-H?O inter-actions, generating a three-dimensional network. The previous study [Nagel et al. (1974 ?). Chem. Commun. pp. 1021-1022] did not establish the absolute structure and no atomic coordinates were published or deposited.
| S-EPMC3379231 | biostudies-literature