Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/6304
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSingh, Nagendra Prasad-
dc.date.accessioned2014-10-13T08:26:30Z-
dc.date.available2014-10-13T08:26:30Z-
dc.date.issued1995-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/6304-
dc.guideOjha, C. S. P.-
dc.description.abstractAdsorption offers an effective method for water and waste water treatment. It produces a high quality-treated water, meeting the requirements of environmental pollution legislation, at a price comparable with secondary biological treatment. Although several mathematical models are available for the design of adsorption, a little work has been done in the field of performance prediction. Though mechanistic models have been used for the performance prediction of fixed bed adsorption system, the same is lacking for batch adsorption system. In the present study the possible use of branched pore kinetic model and recursive algorithms for the performance prediction of batch adsorption system has been studied. For the assesment of the models' short-term performance prediction ability, a large number of available data of the experimental contact time verses concentration for different batch adsorption systems were considered. From the analysis of data it has been found that mechanistic as well as recursive model are equally effective in short term performance prediction. However from operation point of view, the use of recursive algorithms is likely to be preferred because of its simplicity.en_US
dc.language.isoenen_US
dc.subjectCIVIL ENGINEERINGen_US
dc.subjectADSORPTIONen_US
dc.subjectONLINE PREDICTIONen_US
dc.subjectBATCH ADSORPTION SYSTEMen_US
dc.titleON LINE PREDICTION OF BATCH ADSORPTION SYSTEMen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number246813en_US
Appears in Collections:MASTERS' THESES (Civil Engg)

Files in This Item:
File Description SizeFormat 
246813CE.pdf1.59 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.