Big Chemical Encyclopedia

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

Articles Figures Tables About

Processing time calculation

Changes in pnrity and yield of anserine-carnosine, concentrations of each component, and permeate flnx valne with processing time calculated with the mathematical model are shown in Fignre 22.11 together with experimental resnlts. The lines show calcnlated valnes, and the plots show experimental values. The calculated values are in good agreement with experimental valnes, and it was confirmed that the efficiency of the membrane pnrification process conld be predicted with this model precisely. [Pg.313]

D descriptors), the 3D structure, or the molecular surface (3D descriptors) of a structure. Which kind of descriptors should or can be used is primarily dependent on the si2e of the data set to be studied and the required accuracy for example, if a QSPR model is intended to be used for hundreds of thousands of compounds, a somehow reduced accuracy will probably be acceptable for the benefit of short processing times. Chapter 8 gives a detailed introduction to the calculation methods for molecular descriptors. [Pg.490]

When we can avoid storing the pair variables gjj in the memory, we can save the memory space. In the process of calculating the point distribution function fj, we may use gjj but it is not necessary to store gjj each time. [Pg.51]

Any numerical experiment is not a one-time calculation by standard formulas. First and foremost, it is the computation of a number of possibilities for various mathematical models. For instance, it is required to find the optimal conditions for a chemical process, that is, the conditions under which the reaction is completed most rapidly. A solution of this problem depends on a number of parameters (for instance, temperature, pressure, composition of the reacting mixture, etc.). In order to find the optimal workable conditions, it is necessary to carry out computations for different values of those parameters, thereby exhausting all possibilities. Of course, some situations exist in which an algorithm is to be used only several times or even once. [Pg.776]

Processing times ty for all equipment units of the assumed capacities are calculated... [Pg.491]

The available yearly production time H = 52 weeks - 4 weeks for maintenance, holidays, etc. - 16 changeovers/year 0.5 weeks/changeover = 40 weeks, i.e. 40 120 = 4800 h. For the calculation of processing times, assume that physical properties of the reaction mixtures are the same as those of the pure solvents. The capacities of both stirred tanks are = m and = 4 ni . The time... [Pg.494]

Cleaning times are easily accounted for in both policies. The method of search for the shortest cycle time does not change in the case of the ZIV policy if non-zero cleaning times are considered. The slacks can also be easily calculated a priori with non-zero cleaning times. In case of the UIS policy, cleaning times must simply be added to the processing times ... [Pg.510]

Numerical techniques are iterative and require considerable computer processing power. With modern desktop computers, this is usually not an issue and solutions of root uptake over days or weeks typically take a few seconds to generate. However, for some strongly nonlinear problems, such as the development of rhizosphere microbial populations (Sect. Ill), where the increase in microbial biomass may be exponential over time, processing time may become important with solutions requiring >60 min to calculate on a modern PC. [Pg.341]

There is a second relaxation process, called spin-spin (or transverse) relaxation, at a rate controlled by the spin-spin relaxation time T2. It governs the evolution of the xy magnetisation toward its equilibrium value, which is zero. In the fluid state with fast motion and extreme narrowing 7) and T2 are equal in the solid state with slow motion and full line broadening T2 becomes much shorter than 7). The so-called 180° pulse which inverts the spin population present immediately prior to the pulse is important for the accurate determination of T and the true T2 value. The spin-spin relaxation time calculated from the experimental line widths is called T2 the ideal NMR line shape is Lorentzian and its FWHH is controlled by T2. Unlike chemical shifts and spin-spin coupling constants, relaxation times are not directly related to molecular structure, but depend on molecular mobility. [Pg.327]

A great deal can be learned about the absorption process by applying Eqs. (40) and (41) to plasma concentration versus time data. Since there is no model assumption with regard to the absorption process, the calculated values of At/Vd can often be manipulated to determine the kinetic mechanism that controls absorption. This is best illustrated by an example. [Pg.92]

We present here the theory behind the method, which has been used on D3 for some 20 years, to achieve such optimisation. Because (+) and (-) peak count rates and peak/background ratios may differ strongly from one reflection to another and are not known a priori, the measurement is divided into a number of steps of duration T. A first flipping ratio measurement is made in predefined conditions (4+, 4-> 4+, 4-). Then, after calculating the counting-time proportions which minimise the variance of the flipping ratio, the time already spent is subtracted and the measurement is made again with times chosen to achieve these optimised proportions. The process of calculation and measurement is repeated in each step. [Pg.251]

The processing time is calculated based on the same coating mass per particle, thus ... [Pg.362]

The environmental conditions for each of the cases considered below are summarized in Table III all these parameters are constant in time. The build up of the nucleation mode of the stable particles and the build up of both the nucleation and accumulation modes of the radon decay products is calculated, and the results are given after a process time of one hour. Figures 1 to 5 show the size distributions of stable and radioactive particles, and Table IV gives the disequilibrium, the equilibrium factor F, the "unattached fraction" f and the plate-out rates for the different daughters. [Pg.332]

In the next step, all feasible equipment triples consisting of a vessel, a station and an AGV are taken into consideration. The overall execution times, including necessary waiting times, docking times, transfer times and processing times, are calculated for each equipment triple. [Pg.42]

The simulation module simulates the basic operation(s) which are processed by a combination of a vessel and a station using a discrete event simulator. All necessary data (basic operation(s), equipment parameters, recipe scaling percentage, etc.) is provided by the scheduling-module. The simulator calculates the processing times and the state changes of the contents of the vessels (mass, temperature, concentrations, etc.) that are relevant for logistic considerations. [Pg.43]

The quant net is the basis of the discrete optimization. Constraints for the process times and movements of products are considered. Batch sizes will be calculated by the optimization. [Pg.66]

Having discussed the calculation of the individual processing timings, and some material balances, the last type of constraint that is needed is a standard constraint that relates two batches and prevents possible resource conflicts. [Pg.103]

Under dynamic or quasi-steady-state conditions, a continuously monitored process will reveal changes in the operating conditions. When the process is sampled regularly, at discrete periods of time, then along with the spatial redundancy previously defined, we will have temporal redundancy. If the estimation methods presented in the previous chapters were used, the estimates of the desired process variables calculated for two different times, t and t2, are obtained independently, that is, no previous information is used in the generation of estimates for other times. In other words, temporal redundancy is ignored and past information is discarded. [Pg.156]

Finally, a brief discussion is given of a new type of control algorithm called dynamic matrix control. This is a time-domain method that uses a model of the process to calculate future changes in the manipulated variable such that an objective function is minimized. It is basically a least-squares solution. [Pg.253]

There is one method that is based on a time-domain model. It was developed at Shell Oil Company (C, R. Cutler and B. L. Kamaker, Dynamic Matrix Control A Computer Control Algorithm, paper presented at the 86th National AlChE Meeting, 1979) and is called dynamic matrix control (DMC). Several other methods have also been proposed ihat are quite similar. The basic idea is to use a time-domain step-response model of the process to calculate the future changes in the manipulated variable that will minimize some performance index. Much of the explanation of DMC given in this section follows the development presented by C. C. Yu in his Ph.D. thesis (Lehigh University, 1987). [Pg.281]

Calculate the Zicgler-Nichols value for ly for a PI controller. Hold this value constant for the rest of the design. We only add integral action to eliminate steadystate offset, so it is not too critical what value is used, as long as it is reasonable, i.e., about the same magnitude as the process time constant. For our example, the ZN value for ty with a PI controller is 3,03 minutes. [Pg.487]


See other pages where Processing time calculation is mentioned: [Pg.75]    [Pg.75]    [Pg.449]    [Pg.339]    [Pg.35]    [Pg.108]    [Pg.32]    [Pg.37]    [Pg.290]    [Pg.462]    [Pg.489]    [Pg.492]    [Pg.293]    [Pg.44]    [Pg.195]    [Pg.373]    [Pg.133]    [Pg.148]    [Pg.83]    [Pg.77]    [Pg.95]    [Pg.103]    [Pg.149]    [Pg.513]    [Pg.12]    [Pg.175]    [Pg.199]    [Pg.44]    [Pg.152]    [Pg.35]    [Pg.704]   
See also in sourсe #XX -- [ Pg.12 ]




SEARCH



Process Calculations

Process time

Processing time

© 2024 chempedia.info