56 resultados para standard batch algorithms
Resumo:
In this paper, genetic algorithm (GA) is applied to the optimum design of reinforced concrete liquid retaining structures, which comprise three discrete design variables, including slab thickness, reinforcement diameter and reinforcement spacing. GA, being a search technique based on the mechanics of natural genetics, couples a Darwinian survival-of-the-fittest principle with a random yet structured information exchange amongst a population of artificial chromosomes. As a first step, a penalty-based strategy is entailed to transform the constrained design problem into an unconstrained problem, which is appropriate for GA application. A numerical example is then used to demonstrate strength and capability of the GA in this domain problem. It is shown that, only after the exploration of a minute portion of the search space, near-optimal solutions are obtained at an extremely converging speed. The method can be extended to application of even more complex optimization problems in other domains.
Resumo:
Background: Concerns exist regarding the effect of radiation dose from paediatric pelvic CT scans and the potential later risk of radiation-induced neoplasm and teratogenic outcomes in these patients. Objective: To assess the diagnostic quality of CT images of the paediatric pelvis using either reduced mAs or increased pitch compared with standard settings. Materials and methods: A prospective study of pelvic CT scans of 105 paediatric patients was performed using one of three protocols: (1) 31 at a standard protocol of 200 mA with rotation time of 0.75 s at 120 kVp and a pitch factor approximating 1.4; (2) 31 at increased pitch factor approaching 2 and 200 mA; and (3) 43 at a reduced setting of 100 mA and a pitch factor of 1.4. All other settings remained the same in all three groups. Image quality was assessed by radiologists blinded to the protocol used in each scan. Results: No significant difference was found between the quality of images acquired at standard settings and those acquired at half the standard mAs. The use of increased pitch factor resulted in a higher proportion of poor images. Conclusions: Images acquired at 120 kVp using 75 mAs are equivalent in diagnostic quality to those acquired at 150 mAs. Reduced settings can provide useful imaging of the paediatric pelvis and should be considered as a standard protocol in these situations.
Resumo:
In this paper use consider the problem of providing standard errors of the component means in normal mixture models fitted to univariate or multivariate data by maximum likelihood via the EM algorithm. Two methods of estimation of the standard errors are considered: the standard information-based method and the computationally-intensive bootstrap method. They are compared empirically by their application to three real data sets and by a small-scale Monte Carlo experiment.
Resumo:
A robust semi-implicit central partial difference algorithm for the numerical solution of coupled stochastic parabolic partial differential equations (PDEs) is described. This can be used for calculating correlation functions of systems of interacting stochastic fields. Such field equations can arise in the description of Hamiltonian and open systems in the physics of nonlinear processes, and may include multiplicative noise sources. The algorithm can be used for studying the properties of nonlinear quantum or classical field theories. The general approach is outlined and applied to a specific example, namely the quantum statistical fluctuations of ultra-short optical pulses in chi((2)) parametric waveguides. This example uses a non-diagonal coherent state representation, and correctly predicts the sub-shot noise level spectral fluctuations observed in homodyne detection measurements. It is expected that the methods used wilt be applicable for higher-order correlation functions and other physical problems as well. A stochastic differencing technique for reducing sampling errors is also introduced. This involves solving nonlinear stochastic parabolic PDEs in combination with a reference process, which uses the Wigner representation in the example presented here. A computer implementation on MIMD parallel architectures is discussed. (C) 1997 Academic Press.
Resumo:
The production of Long-R-3-IGF-1 (an IGF-1 fusion analog) by constant-rate, fed-batch fermentation of Escherichia coli yielded 2.6 g fusion protein/L, corresponding to an actual IGF-1 concentration of 2.2 g/L. A novel strategy employing three distinct feeding stages was developed which raised product concentration to 4.3 g/L (3.6 g/L of IGF-1) while minimising glucose and acetate accumulation. This improved productivity was not accompanied by an increase in inclusion body size.
Resumo:
The concept of parameter-space size adjustment is pn,posed in order to enable successful application of genetic algorithms to continuous optimization problems. Performance of genetic algorithms with six different combinations of selection and reproduction mechanisms, with and without parameter-space size adjustment, were severely tested on eleven multiminima test functions. An algorithm with the best performance was employed for the determination of the model parameters of the optical constants of Pt, Ni and Cr.
Resumo:
We suggest a new notion of behaviour preserving transition refinement based on partial order semantics. This notion is called transition refinement. We introduced transition refinement for elementary (low-level) Petri Nets earlier. For modelling and verifying complex distributed algorithms, high-level (Algebraic) Petri nets are usually used. In this paper, we define transition refinement for Algebraic Petri Nets. This notion is more powerful than transition refinement for elementary Petri nets because it corresponds to the simultaneous refinement of several transitions in an elementary Petri net. Transition refinement is particularly suitable for refinement steps that increase the degree of distribution of an algorithm, e.g. when synchronous communication is replaced by asynchronous message passing. We study how to prove that a replacement of a transition is a transition refinement.