Big Chemical Encyclopedia

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

Articles Figures Tables About

Availability heuristic

The previous section introduced the backpropagation rule for multi-layer percep-trons. This section briefly discusses tfie model development cycle necessary ftu-obtaining a properly functioning net. It also touches upon some of the available heuristics for determining the proper size of hidden layers. [Pg.546]

One explanation, for which there is considerable research support, concentrates on a particular heuristic - the availability heuristic. The availability heuristic suggests that people s assessment of the probability (and perhaps importance) of events is influenced by the ease with which other instances of the event can be retrieved from memory. This, in itself, is influenced by the number of times the event has been experienced. In other words, the more often an event is experienced, the higher is the estimate of the probability of it happening again. This is common sense. If we experience an event more frequently, it is more likely to occur again. [Pg.38]

Define wastes minimization problem Identify available heuristics of... [Pg.210]

A matrix of wastes minimization is formulated for organizing the available heuristics and techniques of wastes minimization. The process is based on the analysis of the heuristics and techniques that improve the characteristics related with the waste sources... [Pg.210]

As brief as this description is, a number of sources of biases in the thinking that leads to increasing the number of suppliers should be readily apparent. The first and perhaps most obvious is that these events are likely to evoke the availability heuristic and be subject to easy recall based upon several features. These events all impacted lots of people and businesses, caused major suffering, and were subject to a tremendous amount of news media reporting. All these features should make events easy to recall, and therefore, we tend to overestimate the probability of such events. [Pg.226]

Before any matches are placed, the target indicates that the number of units needed is equal to the number of streams (including utility streams) minus one. The tick-off heuristic satisfied the heat duty on one stream every time one of the units was used. The stream that has been ticked off is no longer part of the remaining design problem. The tick-off heuristic ensures that having placed a unit (and used up one of our available units), a stream is removed from the problem. Thus Eq. (7.2) is satisfied if eveiy match satisfies the heat duty on a stream or a utility. [Pg.370]

The number of neurons to be used in the input/output layer are based on the number of input/output variables to be considered in the model. However, no algorithms are available for selecting a network structure or the number of hidden nodes. Zurada [16] has discussed several heuristic based techniques for this purpose. One hidden layer is more than sufficient for most problems. The number of neurons in the hidden layer neuron was selected by a trial-and-error procedure by monitoring the sum-of-squared error progression of the validation data set used during training. Details about this proce-... [Pg.3]

The third and very valuable discovery that the new phthalazine (PHAL) and pyrimidine (PYR) ligand classes (32-35, Figure 2) out-perform the monomeric ligands under identical conditions emerged from a heuristic screening process. The PHAL class in particular has become the first choice for most olefin classes. The PYR class is usually superior for terminal olefins, while the IND class is ideally suited for cA-disubstituted olefins. These ligands are commercially available or can be made easily from relatively inexpensive starting materials. [Pg.682]

This approach to creation of the design involves making a series of best local decisions. This might be based on the use of heuristics or rules of thumb developed from experience4 on a more systematic approach. Equipment is added only if it can be justified economically on the basis of the information available, albeit an incomplete picture. This keeps the structure irreducible, and features that are technically or economically redundant are not included. [Pg.11]

The c-21 substituent can in fact be dispensed with entirely. Perhaps because descinolone acetonide (254) predates 244 by better than a decade, the synthetic sequence reported for its preparation is quite complex. Although descinolone (253) could in principle be prepared in a few steps from some currently available starting materials, such as 241, the original synthesis is presented for its heuristic Value. [Pg.187]

Since the program (DEP) represents a mixed-integer linear program (MILP), it can be solved by commercially available state-of-the-art MILP solvers like CPLEX [3] or XPRESS-MP [4], These solvers are based on implementations of modem branch-and-bound search algorithms with cuts and heuristics. [Pg.198]

From the different planning methods available within SNP, SNP optimization is selected because it offers the best fit to the customer requirements outlined above. The main reasons for this decision are the multisourcing characteristics of the supply network as well as the fact that the objective functions used by the SNP optimizer, profit maximization or cost minimization, correspond to the planning philosophy favored by the customer. In addition to SNP optimization with its cost-based approach, SNP offers several heuristic-based planning methods which follow a rule-based logic. [Pg.248]

Equation (99) implies that it is often possible to specify intervals or approximate values for the scaled elasticities in terms of relative saturation, even when detailed kinetic information is not available. For example, as a rule of thumb, the substrate concentration can often be considered to be on the order of the Km value. As the scaled elasticities, by means of the control coefficients, can be directly translated into a systemic response, it is possible to utilize such heuristic arguments to acquire an initial approximation of global network properties. [Pg.180]

Also when resorting to heuristic rate equations or other approximative schemes, the construction of detailed kinetic models necessitates quantitative knowledge about the kinetic properties of the involved enzymes and membrane transporters. Notwithstanding the formidable progress in experimental accessibility of system variables, detailed in Sections IV and VI, for most metabolic systems such quantitative information is only scarcely available. [Pg.188]


See other pages where Availability heuristic is mentioned: [Pg.466]    [Pg.21]    [Pg.953]    [Pg.2199]    [Pg.2200]    [Pg.2704]    [Pg.35]    [Pg.38]    [Pg.211]    [Pg.1120]    [Pg.223]    [Pg.285]    [Pg.466]    [Pg.21]    [Pg.953]    [Pg.2199]    [Pg.2200]    [Pg.2704]    [Pg.35]    [Pg.38]    [Pg.211]    [Pg.1120]    [Pg.223]    [Pg.285]    [Pg.575]    [Pg.606]    [Pg.457]    [Pg.525]    [Pg.606]    [Pg.555]    [Pg.78]    [Pg.261]    [Pg.508]    [Pg.628]    [Pg.629]    [Pg.629]    [Pg.643]    [Pg.93]    [Pg.62]    [Pg.292]    [Pg.190]    [Pg.507]    [Pg.154]    [Pg.25]    [Pg.129]    [Pg.109]    [Pg.115]   
See also in sourсe #XX -- [ Pg.38 ]




SEARCH



Heuristics

© 2024 chempedia.info