Big Chemical Encyclopedia

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

Articles Figures Tables About

Universal algorithm

The universal algorithm of MC methods was provided early after computers came into use by Metropolis et al. (1953). The name MC stems from a random number generator in the method, similar to that used in casinos. [Pg.310]

Clearly, Cl may not be a universal algorithm, but it would be interesting to see what cycle-lives could be achieved with this procedure on thicker-plate VRLA batteries, where the oxygen cycle is not as active as in the Optima and Genesis products. It should be noted that each product may require a unique approach, as design dictates maximum current levels and recharge times in VRLA products. This has been demonstrated in the Cominco ALABC work on fast charging of Optima (thin-plate) and Delphi (thick-plate) batteries [61]. [Pg.285]

J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, 23 (1977). 337-343. [Pg.477]

Zhang, Z. and Marshall, A. G. A universal algorithm for fast and automated charge state deconvolution of electrospray mass-to-charge ratio spectra. /. Am. Soc. Mass Spectrom., 9, 225, 1998. [Pg.187]

It is unlikely that the true centroid of a peak will coincide with a channel number. If we are to estimate the gamma-ray energy represented by the peak, then we must have a means of determining the position of the peak centroid to within a fraction of a channel. An almost universal algorithm for this is to calculate the following ... [Pg.189]

Zhang, Z. Marshall, AG. A Universal Algorithm for Fast and Automated... [Pg.617]

As it is known [84], the adaptivity universal algorithm is realised at the selforganisation of structures to transition from the previous point of structure instability to the following one ... [Pg.139]

Oldham KB (1986) Convolution a general electrochemical procedure implemented by a universal algorithm. Anal Chem 58(ll) 2296-2300. doi 10.1021/ac00124a040... [Pg.165]

But the methods have not really changed. The Verlet algorithm to solve Newton s equations, introduced by Verlet in 1967 [7], and it s variants are still the most popular algorithms today, possibly because they are time-reversible and symplectic, but surely because they are simple. The force field description was then, and still is, a combination of Lennard-Jones and Coulombic terms, with (mostly) harmonic bonds and periodic dihedrals. Modern extensions have added many more parameters but only modestly more reliability. The now almost universal use of constraints for bonds (and sometimes bond angles) was already introduced in 1977 [8]. That polarisability would be necessary was realized then [9], but it is still not routinely implemented today. Long-range interactions are still troublesome, but the methods that now become popular date back to Ewald in 1921 [10] and Hockney and Eastwood in 1981 [11]. [Pg.4]

James F. Leathrum and John A. Board. The parallel fast multipole algorithm in three dimensions. Technical report. Dept, of Electrical Engineering, Duke University, Durham, 1992. [Pg.95]

C. G. Lambert, Multipole-based Algorithms in Molecular Biophysics and Non-parametric Statistics, Ph.D. Dissertation, Duke University Department of Computer Science, 1997. [Pg.471]

Rankin, W., Board, J. A portable distributed implementation of the parallel multipole tree algorithm. IEEE Symposium on High Performance Distributed Computing. Duke University Technical Report 95-002. [Pg.481]

A computer file of about 19,000 peak wavenumbers and intensities, along with search software, is distributed by the Infrared Data Committee of Japan (IRDC). Donated spectra, which are evaluated by the Coblentz Society in coUaboration with the Joint Committee on Atomic and Molecular Physical Data (JCAMP), are digitized and made avaUable (64). Almost 25,000 ir spectra are avaUable on the SDBS system developed by the NCLl as described. A project was initiated at the University of California, Riverside, in 1986 for the constmction of a database of digitized ftir spectra. The team involved also developed algorithms for spectra evaluation (75). Other sources of spectral Hbraries include Sprouse Scientific, Aston Scientific, and the American Society for Testing and Materials (ASTM). [Pg.121]

Mass Spectroscopy. A coUection of 125,000 spectra is maintained at Cornell University and is avaUable from John WUey Sons, Inc. (New York) on CD-ROM or magnetic tape. The spectra can be evaluated using a quaHty index algorithm (63,76). Software for use with the magnetic tape version to match unknowns is distributed by Cornell (77). The coUection contains aU avaUable spectral information, including isotopicaUy labeled derivatives, partial spectra, and multiple spectra of a single compound. [Pg.121]

John Wiley Sons, Cornell University ms 125,000 CD-ROM, tape isotopic labeled compound QuaUty Index algorithm... [Pg.122]

Data Analysis. The computerization of spectrometers and the concomitant digitization of spectra have caused an explosive increase in the use of advanced spectmm analysis techniques. Data analysis in infrared spectrometry is a very active research area and software producers are constantly releasing more sophisticated algorithms. Each instmment maker has adopted an independent format for spectmm files, which has created difficulties in transferring data. The Joint Committee on Atomic and Molecular Physical Data has developed a universal format for infrared spectmm files called JCAMP-DX (52). Most instmment makers incorporate in thek software a routine for translating thek spectmm files to JCAMP-DX format. [Pg.200]

This is the duration sufficient to simulate seismic conditions. It depends upon the algorithm used to find time history from the reqtiired response spectrum (RRS). The minimum duration of a strong movement, as recommended by IEEE 344, is 15 seconds as illustrated in Figure 14.24(b). This will require a total duration of the order of 20 seconds, including the movement s times of rise and time of decay. A duration of 20.48 seconds, as noted in the figure, is typical of a test conducted at University of Rorkee. The following tests may be conducted ... [Pg.448]

Goldberg, D.E. (1983) Computer-aided gas pipeline operation using genetic algorithms and rule learning (Doctoral dissertation. University of Michigan). Dissertation Abstracts International, 44(10), p. 3174B (University Microfilms No. 8402282). [Pg.429]

A number of workers at Pennsylvania State University examined the push-pull system and found good agreement between their numerical and experimental work. The computational algorithm SIMPLER was used to solve the flow in the two-dimensional push-pull system and it was concluded that for a tank 1.8 m long, the push jet must have an initial velocity of 3.8 m s, that the exhaust flow rate per unit width should be 0.495 m s", and that the ratio of the pull to push flow rates, q /qj, must be between 8.8 and 17.8. [Pg.945]

Class c4 Rules, T20 (r=2) and T88 (r=3) It has been conjectured that all generic class c4 CA are capable of universal computation [wolf85e]. With initial configurations specifying arbitrary algorithmic procedures, such systems can effectively evaluate any computable function and therefore mimic the action of any general purpose computer. [Pg.89]

Although the formal meaning of this statement will be discussed greater detail a bit later in this section, its profound implication is just as easy to appreciate informally. By virtue of being a universal computer, a proper selection of initial conditions can ensure that Life can be made to carry out arbitrary algorithmic procedures - i.e.. Life can serve as a general purpose computer . [Pg.131]

We make three additional comments concerning algorithmic complexity, as defined by equation 12.9. First, while Ku(s) clearly depends on the universal computer [/ that is chosen to run the program V, because of the ability of universal computers to simulate one another, the difference between algorithmic complexities computed for universal computers U and U2 will be bounded by the 0 ) size of the prefix code allowing any program V that is executed on U to be executed... [Pg.625]


See other pages where Universal algorithm is mentioned: [Pg.154]    [Pg.167]    [Pg.283]    [Pg.302]    [Pg.150]    [Pg.154]    [Pg.167]    [Pg.283]    [Pg.302]    [Pg.150]    [Pg.2341]    [Pg.468]    [Pg.497]    [Pg.480]    [Pg.422]    [Pg.167]    [Pg.167]    [Pg.121]    [Pg.200]    [Pg.92]    [Pg.365]    [Pg.25]    [Pg.155]    [Pg.85]    [Pg.496]    [Pg.6]    [Pg.7]    [Pg.14]    [Pg.19]    [Pg.131]    [Pg.571]    [Pg.626]   
See also in sourсe #XX -- [ Pg.302 ]




SEARCH



© 2024 chempedia.info