𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Design optimization of continuous sterilizers

✍ Scribed by M. H. J. Ashley; J. G. Mooyman


Publisher
John Wiley and Sons
Year
1982
Tongue
English
Weight
224 KB
Volume
24
Category
Article
ISSN
0006-3592

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Optimization and design considerations o
✍ E Huenupi; A Gomez; B A Andrews; J A Asenjo πŸ“‚ Article πŸ“… 1999 πŸ› Wiley (John Wiley & Sons) 🌐 English βš– 193 KB

Aqueous two-phase systems (ATPS) have begun to be used industrially for the isolation and separation of recombinant enzyme proteins. However, until now most studies have concentrated on investigating factors aΓΎ ecting the partition coefficients of molecules and even the pilot plant and scale-up deve

Optimal design of batch-storage network
✍ Gyeongbeom Yi; Gintaras V. Reklaitis πŸ“‚ Article πŸ“… 2005 πŸ› American Institute of Chemical Engineers 🌐 English βš– 209 KB πŸ‘ 2 views

## Abstract The periodic square wave (PSW) model was successfully applied to the optimal design of a batch‐storage network. The network structure can cover any type of batch production, distribution, and inventory system, including recycle streams. Here we extend the coverage of the PSW model to mu

Optimal transition and robust control de
✍ Antonio Flores-Tlacuahuac; JesΓΊs Alvarez; Enrique SaldΓ­var-Guerra; Guillermo Oax πŸ“‚ Article πŸ“… 2005 πŸ› American Institute of Chemical Engineers 🌐 English βš– 201 KB πŸ‘ 1 views

## Abstract The problem of jointly designing the optimal steady‐state transition and the related tracking controller for a representative class of exothermic continuous chemical reactors is addressed. The combination of optimal, constructive, and conventional control ideas yields a design methodolo

Constructions of optimal packing designs
✍ Jianxing Yin; Ahmed M. Assaf πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 195 KB πŸ‘ 1 views

Let v and k be positive integers. A (v, k, 1)-packing design is an ordered pair (V, B B B) where V is a v-set and B B B is a collection of k-subsets of V (called blocks) such that every 2-subset of V occurs in at most one block of B B B. The packing problem is mainly to determine the packing number