Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Selection algorithms

Figure 8. Thrombin inhibitors identified by a genetic algorithm selection O method. Figure 8. Thrombin inhibitors identified by a genetic algorithm selection O method.
FIGURE 6 Convergence characteristics of the algorithm selecting the channel A, both parameters estimated simultaneously A, channel for parameter h opened first O, Channel for parameter X opened first (from Bortolotto et al., 1985). [Pg.196]

Upon termination of the process the algorithm selects a compound set from the working population equal to the user-supplied library size as the library proposed. The selection of the library members is performed in a manner identical to the parent selection method described previously. [Pg.62]

Control System Synthesis. The synthesis problem for control systems is to select the controllers needed to meet specified control goals for a fixed plant configuration. The designer selects his goals by stating which variables he wishes controlled. The synthesis algorithm selects which variables to measure, which to manipulate and what type of controllers to use. [Pg.79]

A word needs to be said about controller type and controller tuning. Controller algorithm selection and tuning are important to the success of any control system. Two features should be recognized about the Eastman process. First, it is an integrating process with little selfregulation in terms of pressure, liquid levels, and chemical components. Second, there are no tight specifications on any variables. [Pg.263]

The alternative, and far more advantageous, form of data processing is to store each detector output value as it is received (usually on a hard disc) and then process the results after the analysis has been completed. This method give complete flexibility in data reduction, allows the chromatogram to be reconstructed in a number of alternative forms and different algorithms selected for base line correction or peak area measurement, etc. It also allows specific portions of the chromatogram to be amplified to show the presence of trace materials. [Pg.75]

Only a small number of compounds is chosen for synthesis in the first step at random. The compounds are then tested in a biochemical or biological assay, and the design algorithm selects a new set of compounds from the virtual Hbrary automatically [131, 132]. [Pg.598]

Running comparisons can take a significant amount of time, which is dependent upon the number and length of the sequences submitted, the algorithm selected, and the number of other users of the system. An e-mail notification can therefore be sent once the job has completed. To enable this option, enter an e-mail address in the e-mail address box. [Pg.68]

Note that the exchange algorithm selects all or most of the experiments at the exterior of the domain. The worker may wish to add a number of (replicated) experiments at the centre of gravity. This may often improve the precision uniformity of the design. [Pg.442]

A reduced FORTRAN code to fit the magnetic susceptibility is available on request from the author [17]. The optimisation algorithms selected there cover the simulated annealing method combined with the simplex method. [Pg.343]

Mitchell, M. An Introduction to Genetic Algorithms, MIT Press Cambridge, MA, 1996. Gilman, A Ross, I. Genetic-algorithm selection of a regulatory structure that directs flux in a simple metabolic model. Biophys. J. 1995, 69, 1321-1333. [Pg.123]

The simplest design just lets the D-optimal algorithm select a given number of substituents from the candidate set. This would be a purely statistical diversity design it is unbiased, but has linle else to recommend it. The next level of complexity is to select a fixed number of substituents for inclusion by hand, based on pharmacological or synthetic ideas, and then let the D-optimal... [Pg.84]

The algorithm selected to handle a numerical problem, which is well posed and well conditioned, can be stable or unstable. [Pg.306]

There are several considerations to be made in regard to algorithm selection. One of these Is computational efficiency as it relate s to the reliability of the reconstruction. We nave shown that even for small reconstruction volumes, e.g., 64 X 64 X 62, there is a significant difference in computation time (9 min CPU for Feidkamp and 16 min CPU for Radon). However, as the size of the reconstructed volume increases, even more significant differences in elapsed time are likely. This leads to the need for high-speed computer . . [Pg.467]

The comprehensive architectural design decision is taken based on the reliability evaluation using failure propagation (Algorithm 3). The algorithm selects the architecture that has higher reliability and performs more exhaustive comparison than the quick decision approach of Algorithm 2. [Pg.30]


See other pages where Selection algorithms is mentioned: [Pg.406]    [Pg.134]    [Pg.112]    [Pg.52]    [Pg.39]    [Pg.59]    [Pg.318]    [Pg.182]    [Pg.106]    [Pg.240]    [Pg.165]    [Pg.65]    [Pg.215]    [Pg.952]    [Pg.157]    [Pg.467]    [Pg.487]    [Pg.591]    [Pg.336]    [Pg.10]    [Pg.272]    [Pg.122]    [Pg.85]    [Pg.486]    [Pg.475]    [Pg.68]    [Pg.70]    [Pg.223]    [Pg.42]    [Pg.469]    [Pg.446]    [Pg.402]    [Pg.2]    [Pg.306]   
See also in sourсe #XX -- [ Pg.467 ]




SEARCH



Automatic descriptor selection algorithm

Branch selection algorithms

Genetic algorithm parent selection

Genetic algorithm subset selection

Genetic algorithms selection

Genetic algorithms tournament selection

Maximum Mutual Information Based Sensor Selection Algorithm

Screen set selection algorithm

Stochastic selection algorithms

© 2024 chempedia.info