Big Chemical Encyclopedia

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

Articles Figures Tables About

Algorithm, modeling

It can be seen from the algorithm model stated above that in the Krotov method the electric field obtained in the feth iteration is used immediately to propagate /(f), which has a direct contribution to the new electric field in the next time step. In one iteration, the Krotov method involves three wave packet propagations, that is, the forward propagations of and x (t) in Steps 8.3... [Pg.86]

Knowledge Database It stores information about space, time, entities, events, states of the system environment and about the system itself, parameters of the algorithms, models for simulation, etc. [Pg.515]

C/R—Communication/Real Time, KR—Knowledge Representation, IE—Interface Engines, AM—Algorithmic Model, DB—Data Base Manager, CAD—Computer Aided Design, G—Computer Graphics. [Pg.163]

The valves are straightforward and are often implemented as ideal diodes (for electrical circuit models) or as IF-THEN-ELSE statements (for algorithmic models) to keep all flows nonnegative. Defects in the valves can be added to simulate heart defects (e.g., leaky diodes for regurgitation). Other types of heart defects are just as easily simulated. For example, Blackstone et al. [1976] placed an impedance between the atrial chambers to simulate a septal opening. [Pg.162]

Algorithmic models. These use effort drivers reflecting quantitative aspects of the software application to be built (such as the lines of code to be... [Pg.254]

With the remaining, true methods there are numerous overlaps. Top-down approaches, for example, will often be based on algorithmic models. An expert, when asked to produce an estimate of effort, might in fact use any method, including asking another expert. However, there is some evidence that experts tend to adopt an analogy approach. If a previous application that is a reasonable match... [Pg.255]

Nearly all the techniques listed above, especially the algorithmic models, depend on some measure of software size. If the size of implemented software applications can be measured in some manner, for example, in lines of code, and the actual effort needed for these applications is also recorded, then a productivity rate can be derived as size/effort (e.g., as lines of code per day). If, for a new project, the probable size is known, then by applying the historical productivity rate an estimate of effort for the new project can be arrived at. [Pg.255]

The algorithmic model is a refinement of the domain-based model. The refinement is that the algorithmic model takes the input history into account when selecting the next input. The model may be viewed as drawing balls from an urn, where the distribution of balls is changed by the input history. [Pg.320]

To define the usage profile for the algorithmic model, the input history must be partitioned into a set of classes. [Pg.320]

If the system is a batch system, then either the domain-based model or the algorithmic model is suitable, but not if the input history is important. If the input history is important, there are the grammar, the Markov, or the SHY models. These models take the input history into account, and the input can be described in detail if necessary. If the... [Pg.323]

Hence, in this case, the fibres do not contribute towards the overall mechanical properties of the composite, but act instead as stress concentrators, leading to catastrophic failure. It can also be observed that one of the algorithms (model 3) describes quite well both the loss of impact strength and the reduction of fibre length. [Pg.447]

Hunger J et al (1998) How to derive force field parameters by genetic algorithms modelling tripod-Mo(CO)(3) compounds as an example. Eur J Inorg Chem 6 693-702... [Pg.42]

These modifications enable the algorithmic models to include four rather than two different components or base pair types. Appendix B shows the... [Pg.189]


See other pages where Algorithm, modeling is mentioned: [Pg.474]    [Pg.142]    [Pg.71]    [Pg.287]    [Pg.121]    [Pg.133]    [Pg.527]    [Pg.108]    [Pg.288]    [Pg.335]    [Pg.406]    [Pg.164]    [Pg.155]    [Pg.386]    [Pg.458]    [Pg.247]    [Pg.653]    [Pg.228]    [Pg.229]    [Pg.2038]    [Pg.255]    [Pg.255]    [Pg.320]    [Pg.136]    [Pg.122]    [Pg.136]    [Pg.24]    [Pg.171]    [Pg.666]    [Pg.212]    [Pg.690]    [Pg.408]    [Pg.258]    [Pg.60]    [Pg.410]   
See also in sourсe #XX -- [ Pg.47 , Pg.48 , Pg.48 , Pg.82 , Pg.83 , Pg.84 ]




SEARCH



Algorithm and Results for the Model System

Algorithmic methods fluid particle model

Algorithmic process synthesis MINLP modeling

Algorithms for models

Computer modeling genetic algorithm

Explicit Fractional Step Algorithm for Solving the Two-Fluid Model Equations Applied to Bubble Column Flow

Fuzzy modeling algorithm

Gauss-Newton Algorithm for ODE Models

Genetic algorithms in molecular modeling

Genetic algorithms three-descriptor models

Ising model Wolff algorithm

Minimal models search algorithm

Model Algorithmic Control

Model algorithms

Model algorithms

Model construction algorithms

Model predictive control algorithms

Model reduction Algorithm

Model systems algorithm

Model-based control algorithms

Modeling algorithm for

Models of Genetic Algorithms

Multilinear modeling algorithms

Multiscale modeling computational algorithms

Protein Flexibility in Structure-Based Virtual Screening From Models to Algorithms

© 2024 chempedia.info