Exploring the parameter space of a rabbit ventricular action potential model to investigate the effect of variation on action potential and calcium transients

Computational models for cardiomyocyte action potentials (AP) often make use of a large parameter set. This parameter set can contain some elements that are fitted to experimental data independently of any other element, some elements that are derived concurrently with other elements to match experimental data, and some elements that are derived purely from phenomenological fitting to produce the desired AP output. Furthermore, models can make use of several different data sets, not always derived for the same conditions or even the same species. It is consequently uncertain whether the parameter set for a given model is physiologically accurate. Furthermore, it is only recently that the possibility of degeneracy in parameter values in producing a given simulation output has started to be addressed. In this study, we examine the effects of varying two parameters (the L-type calcium current (I(CaL)) and the delayed rectifier potassium current (I(Ks))) in a computational model of a rabbit ventricular cardiomyocyte AP on both the membrane potential (V(m)) and calcium (Ca(2+)) transient. It will subsequently be determined if there is degeneracy in this model to these parameter values, which will have important implications on the stability of these models to cell-to-cell parameter variation, and also whether the current methodology for generating parameter values is flawed. The accuracy of AP duration (APD) as an indicator of AP shape will also be assessed.

Comparison of the gate drive parameter space for driving power MOSFETs using conventional and cascode configurations

Conventional voltage driven gate drive circuits utilise a resistor to control the switching speed of power MOS-FETs. The gate resistance is adjusted to provide controlled rate of change of load current and voltage. The cascode gate drive configuration has been proposed as an alternative to the conventional resistor-fed gate drive circuit. While cascode drive is broadly understood in the literature the switching characteristics of this topology are not well documented. This paper explores, through both simulation and experimentation, the gate drive parameter space of the cascode gate drive configuration and provides a comparison to the switching characteristics of conventional gate drive.

Populations of models, experimental designs and coverage of parameter space by Latin Hypercube and Orthogonal Sampling

In this paper we have used simulations to make a conjecture about the coverage of a t-dimensional subspace of a d-dimensional parameter space of size n when performing k trials of Latin Hypercube sampling. This takes the form P(k,n,d,t) = 1 - e^(-k/n^(t-1)). We suggest that this coverage formula is independent of d and this allows us to make connections between building Populations of Models and Experimental Designs. We also show that Orthogonal sampling is superior to Latin Hypercube sampling in terms of allowing a more uniform coverage of the t-dimensional subspace at the sub-block size level. These ideas have particular relevance when attempting to perform uncertainty quantification and sensitivity analyses.

Estimates on the coverage of parameter space using populations of models

In this paper we provide estimates for the coverage of parameter space when using Latin Hypercube Sampling, which forms the basis of building so-called populations of models. The estimates are obtained using combinatorial counting arguments to determine how many trials, k, are needed in order to obtain specified parameter space coverage for a given value of the discretisation size n. In the case of two dimensions, we show that if the ratio (Ø) of trials to discretisation size is greater than 1, then as n becomes moderately large the fractional coverage behaves as 1-exp-ø. We compare these estimates with simulation results obtained from an implementation of Latin Hypercube Sampling using MATLAB.

The parameter space of graphene chemical vapor deposition on polycrystalline Cu

A systematic study of the parameter space of graphene chemical vapor deposition (CVD) on polycrystalline Cu foils is presented, aiming at a more fundamental process rationale in particular regarding the choice of carbon precursor and mitigation of Cu sublimation. CH 4 as precursor requires H 2 dilution and temperatures ≥1000 °C to keep the Cu surface reduced and yield a high-quality, complete monolayer graphene coverage. The H 2 atmosphere etches as-grown graphene; hence, maintaining a balanced CH 4/H 2 ratio is critical. Such balance is more easily achieved at low-pressure conditions, at which however Cu sublimation reaches deleterious levels. In contrast, C 6H 6 as precursor requires no reactive diluent and consistently gives similar graphene quality at 100-150 °C lower temperatures. The lower process temperature and more robust processing conditions allow the problem of Cu sublimation to be effectively addressed. Graphene formation is not inherently self-limited to a monolayer for any of the precursors. Rather, the higher the supplied carbon chemical potential, the higher the likelihood of film inhomogeneity and primary and secondary multilayer graphene nucleation. For the latter, domain boundaries of the inherently polycrystalline CVD graphene offer pathways for a continued carbon supply to the catalyst. Graphene formation is significantly affected by the Cu crystallography; i.e., the evolution of microstructure and texture of the catalyst template form an integral part of the CVD process. © 2012 American Chemical Society.

Periodic window arising in the parameter space of an impact oscillator

In the bi-dimensional parameter space of an impact-pair system, shrimp-shaped periodic windows are embedded in chaotic regions. We show that a weak periodic forcing generates new periodic windows near the unperturbed one with its shape and periodicity. Thus, the new periodic windows are parameter range extensions for which the controlled periodic oscillations substitute the chaotic oscillations. We identify periodic and chaotic attractors by their largest Lyapunov exponents. (C) 2010 Elsevier B.V. All rights reserved.

Parameter space for a dissipative Fermi-Ulam model

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Statistical properties for a dissipative model of relativistic particles in a wave packet: A parameter space investigation

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Reducing the parameter space for unparticle-inspired models using white dwarf masses

Based on astrophysical constraints derived from Chandrasekhar's mass limit for white dwarfs, we study the effects of the model on the parameters of unparticle-inspired gravity, on scales Lambda(U) > 1 TeV and d(U) approximate to 1.

Exploration of the parameter space in an agent-based model of tuberculosis spread: emergence of drug resistance in developing vs developed countries

In this work we present an agent-based model for the spread of tuberculosis where the individuals can be infected with either drug-susceptible or drug-resistant strains and can also receive a treatment. The dynamics of the model and the role of each one of the parameters are explained. The whole set of parameters is explored to check their importance in the numerical simulation results. The model captures the beneficial impact of the adequate treatment on the prevalence of tuberculosis. Nevertheless, depending on the treatment parameters range, it also captures the emergence of drug resistance. Drug resistance emergence is particularly likely to occur for parameter values corresponding to less efficacious treatment, as usually found in developing countries.

Mixture density network training by computation in parameter space

Training Mixture Density Network (MDN) configurations within the NETLAB framework takes time due to the nature of the computation of the error function and the gradient of the error function. By optimising the computation of these functions, so that gradient information is computed in parameter space, training time is decreased by at least a factor of sixty for the example given. Decreased training time increases the spectrum of problems to which MDNs can be practically applied making the MDN framework an attractive method to the applied problem solver.

Type space on a purely measurable parameter space

Several game theoretical topics require the analysis of hierarchical beliefs, particularly in incomplete information situations. For the problem of incomplete information, Hars´anyi suggested the concept of the type space. Later Mertens & Zamir gave a construction of such a type space under topological assumptions imposed on the parameter space. The topological assumptions were weakened by Heifetz, and by Brandenburger & Dekel. In this paper we show that at very natural assumptions upon the structure of the beliefs, the universal type space does exist. We construct a universal type space, which employs purely a measurable parameter space structure.

Parameter space of experimental chaotic circuits with high-precision control parameters

The authors thank Professor Iber^e Luiz Caldas for the suggestions and encouragement. The authors F.F.G.d.S., R.M.R., J.C.S., and H.A.A. acknowledge the Brazilian agency CNPq and state agencies FAPEMIG, FAPESP, and FAPESC, and M.S.B. also acknowledges the EPSRC Grant Ref. No. EP/I032606/1.

Discrete parameter simulation optimization algorithms with applications to admission control with dependent service times

We propose certain discrete parameter variants of well known simulation optimization algorithms. Two of these algorithms are based on the smoothed functional (SF) technique while two others are based on the simultaneous perturbation stochastic approximation (SPSA) method. They differ from each other in the way perturbations are obtained and also the manner in which projections and parameter updates are performed. All our algorithms use two simulations and two-timescale stochastic approximation. As an application setting, we consider the important problem of admission control of packets in communication networks under dependent service times. We consider a discrete time slotted queueing model of the system and consider two different scenarios - one where the service times have a dependence on the system state and the other where they depend on the number of arrivals in a time slot. Under our settings, the simulated objective function appears ill-behaved with multiple local minima and a unique global minimum characterized by a sharp dip in the objective function in a small region of the parameter space. We compare the performance of our algorithms on these settings and observe that the two SF algorithms show the best results overall. In fact, in many cases studied, SF algorithms converge to the global minimum.