Development and Validation of a Parameter-Free Model Chemistry for the Computation of Reliable Reaction Rates.
Ontology highlight
ABSTRACT:
SUBMITTER: Barone V
PROVIDER: S-EPMC8359010 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Understanding thermal transport at the submicron scale is crucial for engineering applications, especially in the thermal management of electronics and tailoring the thermal conductivity of thermoelectric materials. At the submicron scale, the macroscopic heat diffusion equation is no longer valid and the phonon Boltzmann transport equation (BTE) becomes the governing equation for thermal transport. However, previous thermal simulations based on the phonon BTE have two main limitations: relying on empirical parameters and prohibitive computational costs. Therefore, the phonon BTE is commonly used for qualitatively studying the non-Fourier thermal transport phenomena of toy problems. In this work, we demonstrate an ultra-efficient and parameter-free computational method of the phonon BTE to achieve quantitatively accurate thermal simulation for realistic materials and devices. By properly integrating the phonon properties from first-principles calculations, our method does not rely on empirical material properties input. It can be generally applicable for different materials and the predicted results can match well with experimental results. Moreover, by developing a suitable ensemble of advanced numerical algorithms, our method exhibits superior numerical efficiency. The full-scale (from ballistic to diffusive) thermal simulation of a 3-dimensional fin field-effect transistor with 13 million degrees of freedom, which is prohibitive for existing phonon BTE solvers even on supercomputers, can now be completed within two hours on a single personal computer. Our method makes it possible to achieve the predictive design of realistic nanostructures for the desired thermal conductivity. It also enables accurately resolving the temperature profiles at the transistor level, which helps in better understanding the self-heating effect of electronics.
| S-EPMC11330117 | biostudies-literature
Project description:Approximate Bayesian computation (ABC) methods can be used to evaluate posterior distributions without having to calculate likelihoods. In this paper, we discuss and apply an ABC method based on sequential Monte Carlo (SMC) to estimate parameters of dynamical models. We show that ABC SMC provides information about the inferability of parameters and model sensitivity to changes in parameters, and tends to perform better than other ABC approaches. The algorithm is applied to several well-known biological systems, for which parameters and their credible intervals are inferred. Moreover, we develop ABC SMC as a tool for model selection; given a range of different mathematical descriptions, ABC SMC is able to choose the best model using the standard Bayesian model selection apparatus.
| S-EPMC2658655 | biostudies-literature
Project description:The development of mechanistic models of biological systems is a central part of Systems Biology. One major challenge in developing these models is the accurate inference of model parameters. In recent years, nested sampling methods have gained increased attention in the Systems Biology community due to the fact that they are parallelizable and provide error estimates with no additional computations. One drawback that severely limits the usability of these methods, however, is that they require the likelihood function to be available, and thus cannot be applied to systems with intractable likelihoods, such as stochastic models. Here we present a likelihood-free nested sampling method for parameter inference which overcomes these drawbacks. This method gives an unbiased estimator of the Bayesian evidence as well as samples from the posterior. We derive a lower bound on the estimators variance which we use to formulate a novel termination criterion for nested sampling. The presented method enables not only the reliable inference of the posterior of parameters for stochastic systems of a size and complexity that is challenging for traditional methods, but it also provides an estimate of the obtained variance. We illustrate our approach by applying it to several realistically sized models with simulated data as well as recently published biological data. We also compare our developed method with the two most popular other likeliood-free approaches: pMCMC and ABC-SMC. The C++ code of the proposed methods, together with test data, is available at the github web page https://github.com/Mijan/LFNS_paper.
| S-EPMC7577508 | biostudies-literature
Project description:Neuronal activity in the brain is variable, yet both perception and behavior are generally reliable. How does the brain achieve this? Here, we show that the conjunctive coding of multiple stimulus features, commonly known as nonlinear mixed selectivity, may be used by the brain to support reliable information transmission using unreliable neurons. Nonlinearly mixed feature representations have been observed throughout primary sensory, decision-making, and motor brain areas. In these areas, different features are almost always nonlinearly mixed to some degree, rather than represented separately or with only additive (linear) mixing, which we refer to as pure selectivity. Mixed selectivity has been previously shown to support flexible linear decoding for complex behavioral tasks. Here, we show that it has another important benefit: in many cases, it makes orders of magnitude fewer decoding errors than pure selectivity even when both forms of selectivity use the same number of spikes. This benefit holds for sensory, motor, and more abstract, cognitive representations. Further, we show experimental evidence that mixed selectivity exists in the brain even when it does not enable behaviorally useful linear decoding. This suggests that nonlinear mixed selectivity may be a general coding scheme exploited by the brain for reliable and efficient neural computation.
| S-EPMC7048320 | biostudies-literature
Project description:PurposeShock-wave lithotripsy (SWL) is accepted as the first line treatment modality for uncomplicated upper urinary tract stones; however, validated prediction models with regards to stone-free rates (SFRs) are still needed. We aimed to develop nomograms predicting SFRs after the first and within the third session of SWL. Computed tomography (CT) information was also modeled for constructing nomograms.Materials and methodsFrom March 2006 to December 2013, 3028 patients were treated with SWL for ureter and renal stones at our three tertiary institutions. Four cohorts were constructed: Total-development, Total-validation, CT-development, and CT-validation cohorts. The nomograms were developed using multivariate logistic regression models with selected significant variables in a univariate logistic regression model. A C-index was used to assess the discrimination accuracy of nomograms and calibration plots were used to analyze the consistency of prediction.ResultsThe SFR, after the first and within the third session, was 48.3% and 68.8%, respectively. Significant variables were sex, stone location, stone number, and maximal stone diameter in the Total-development cohort, and mean Hounsfield unit (HU) and grade of hydronephrosis (HN) were additional parameters in the CT-development cohort. The C-indices were 0.712 and 0.723 for after the first and within the third session of SWL in the Total-development cohort, and 0.755 and 0.756, in the CT-development cohort, respectively. The calibration plots showed good correspondences.ConclusionsWe constructed and validated nomograms to predict SFR after SWL. To the best of our knowledge, these are the first graphical nomograms to be modeled with CT information. These may be useful for patient counseling and treatment decision-making.
| S-EPMC4758663 | biostudies-literature
Project description:Delay discounting reflects the rate at which a reward loses its subjective value as a function of delay to that reward. Many models have been proposed to measure delay discounting, and many comparisons have been made among these models. We highlight the two-parameter delay discounting model popularized by Howard Rachlin by demonstrating two key practical features of the Rachlin model. The first feature is flexibility; the Rachlin model fits empirical discounting data closely. Second, when compared with other available two-parameter discounting models, the Rachlin model has the advantage that unique best estimates for parameters are easy to obtain across a wide variety of potential discounting patterns. We focus this work on this second feature in the context of maximum likelihood, showing the relative ease with which the Rachlin model can be utilized compared with the extreme care that must be used with other models for discounting data, focusing on two illustrative cases that pass checks for data validity. Both of these features are demonstrated via a reanalysis of discounting data the authors have previously used for model selection purposes.
| S-EPMC10108293 | biostudies-literature
Project description:Computing with molecules is at the center of complex natural phenomena, where the information contained in ordered sequences of molecules is used to implement functionalities of synthesized materials or to interpret the environment, as in Biology. This uses large macromolecules and the hindsight of billions of years of natural evolution. But, can one implement computation with small molecules? If so, at what levels in the hierarchy of computing complexity? We review here recent work in this area establishing that all physically realizable computing automata, from Finite Automata (FA) (such as logic gates) to the Linearly Bound Automaton (LBA, a Turing Machine with a finite tape) can be represented/assembled/built in the laboratory using oscillatory chemical reactions. We examine and discuss in depth the fundamental issues involved in this form of computation exclusively done by molecules. We illustrate their implementation with the example of a programmable finite tape Turing machine which using the Belousov-Zhabotinsky oscillatory chemistry is capable of recognizing words in a Context Sensitive Language and rejecting words outside the language. We offer a new interpretation of the recognition of a sequence of chemicals representing words in the machine's language as an illustration of the "Maximum Entropy Production Principle" and concluding that word recognition by the Belousov-Zhabotinsky Turing machine is equivalent to extremal entropy production by the automaton. We end by offering some suggestions to apply the above to problems in computing, polymerization chemistry, and other fields of science.
| S-EPMC8144498 | biostudies-literature
Project description:We consider a computing system where a master processor assigns a task for execution to worker processors that may collude. We model the workers' decision of whether to comply (compute the task) or not (return a bogus result to save the computation cost) as a game among workers. That is, we assume that workers are rational in a game-theoretic sense. We identify analytically the parameter conditions for a unique Nash Equilibrium where the master obtains the correct result. We also evaluate experimentally mixed equilibria aiming to attain better reliability-profit trade-offs. For a wide range of parameter values that may be used in practice, our simulations show that, in fact, both master and workers are better off using a pure equilibrium where no worker cheats, even under collusion, and even for colluding behaviors that involve deviating from the game.
| S-EPMC4391324 | biostudies-literature
Project description:We introduce an adaptive weighted-ensemble procedure (aWEP) for efficient and accurate evaluation of first-passage rates between states for two-state systems. The basic idea that distinguishes aWEP from conventional weighted-ensemble (WE) methodology is the division of the configuration space into smaller regions and equilibration of the trajectories within each region upon adaptive partitioning of the regions themselves into small grids. The equilibrated conditional?transition probabilities between each pair of regions lead to the determination of populations of the regions and the first-passage times between regions, which in turn are combined to evaluate the first passage times for the forward and backward transitions between the two states. The application of the procedure to a non-trivial coarse-grained model of a 70-residue calcium binding domain of calmodulin is shown to efficiently yield information on the equilibrium probabilities of the two states as well as their first passage times. Notably, the new procedure is significantly more efficient than the canonical implementation of the WE procedure, and this improvement becomes even more significant at low temperatures.
| S-EPMC3460967 | biostudies-literature
Project description:A theoretical framework is developed to study the dynamics of protein folding. The key insight is that the search for the native protein conformation is influenced by the rate r at which external parameters, such as temperature, chemical denaturant, or pH, are adjusted to induce folding. A theory based on this insight predicts that 1), proteins with complex energy landscapes can fold reliably to their native state; 2), reliable folding can occur as an equilibrium or out-of-equilibrium process; and 3), reliable folding only occurs when the rate r is below a limiting value, which can be calculated from measurements of the free energy. We test these predictions against numerical simulations of model proteins with a single energy scale.
| S-EPMC2527276 | biostudies-other