On the effect of experimental error on the calculation of the number of stages for a given distillation separation
β Scribed by A.G. Medina; C. McDermott; N. Ashton
- Publisher
- Elsevier Science
- Year
- 1974
- Tongue
- English
- Weight
- 245 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0009-2509
No coin nor oath required. For personal study only.
β¦ Synopsis
Earlier work on the effect of experimental error is re-examined, certain limitations are brought out and some of the formulae are re-derived.
A method of direct evaluation is also presented which overcomes the former limitations, is of universal applicability and involves no greater computational effort.
π SIMILAR VOLUMES
We consider the following graph labeling problem, introduced by Leung et al. (3. Y-T. Leung, 0. Vornberger, and J. D. Witthoff, On some variants of the bandwidth minimization problem. SIAM J. Comput. 13 (1984) 650-667). Let G be a graph of order n, and f a bijection from the separation number of G,
Let \_ # S k and { # S n be permutations. We say { contains \_ if there exist Stanley and Wilf conjectured that for any \_ # S k there exists a constant c=c(\_) such that F(n, \_) c n for all n. Here we prove the following weaker statement: For every fixed \_ # S k , F(n, \_) c n#\* (n) , where c=c
BACKGROUND: Diffusion distillation of ethanol-water mixtures in the presence of air as an inert gas has been used to produce fuel grade ethanol, and studies on the effect of vaporization temperature and feed composition on the selectivity and total molar flux have been presented recently. This paper
A~S~IW~--ZLJ~ERW~G and HARMENS [l] have already given strong evidence of the importance of interfacial properties in various types of distillation equipment. The work herein reported demonstrates how some of the interfacial effects can be controlled to advantage by the use of small amounts of surfac
This note can be treated a s a supplement to a paper written by Bollobas which was devoted to the vertices of a given degree in a random graph. We determine some values of the edge probability p for which the number of vertices of a given degree of a random graph G E ?An, p) asymptotically has a nor