@article { ISI:000244413600017,
	title = {Spinning wave motion in frontal polymerization},
	journal = {Chemical Engineering Science},
	volume = {62},
	number = {5},
	year = {2007},
	month = {MAR},
	pages = {1448-1455},
	publisher = {PERGAMON-ELSEVIER SCIENCE LTD},
	type = {Article},
	address = {THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND},
	abstract = {<p>We present a mathematical model describing dynamics of spinning waves which propagate during frontal polymerization reaction taking place in a cylindrical reactor tube. The self-organization of spatio-temporal solution of wave equations due to interplay between thermal diffusion and kinetics gives rise to pattern formation. We begin with a fundamental equation of motion of radial coordinate after defining an asymptotic phase for spinmode. The motion is analyzed near a critical (Hopf) point and a perturbation solution is used to obtain patterns for a case of preparation of poly(2-hydroxyethyl methacrylate) (PHEMA) via frontal polymerization reaction. The model uses the distance as seen in photograph taken using scanning electron microscope (SEM) from which motion begins around core of spiral and calculates pitch of spiral which matches closely with experimental observation in micrograph. Also the model predicts qualitatively the ramp wave and spiral wave motion as observed under SEM. Both these results are reported in open literature for the first time to our best knowledge. (c) 2006 Elsevier Ltd. All rights reserved.</p>},
	keywords = {frontal polymerization, spinning wave, spiral motion, wave dynamics},
	issn = {0009-2509},
	doi = {10.1016/j.ces.2006.11.037},
	author = {Inamdar, Satish R. and Pujari, N. S. and Karimi, I. A. and Ponrathnam, S. and Tayal, R. K. and Kulkarni, B. D.}
}
@article { ISI:000296871800013,
	title = {Sharp cut algorithm for optimization},
	journal = {Computers \& Chemical Engineering},
	volume = {35},
	number = {12},
	year = {2011},
	month = {DEC},
	pages = {2716-2728},
	publisher = {PERGAMON-ELSEVIER SCIENCE LTD},
	address = {THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND},
	abstract = {<p>In this paper, we introduce a new cutting plane algorithm which is computationally less expensive and more efficient than Kelley{\textquoteright}s algorithm. This new cutting plane algorithm uses an intersection cut of three types of cutting planes. We find from numerical results that the global search method formed using successive linear programming and a new intersection set is at least twice as fast as Kelley{\textquoteright}s cutting planes. The necessary mathematical analysis and convergence theorem are provided. The key findings are illustrated via optimization of a cascade of three CSTRs. (C) 2010 Elsevier Ltd. All rights reserved.</p>},
	keywords = {Convergence theorem, Cutting plane, Sharp cut, Successive linear programming},
	issn = {0098-1354},
	doi = {10.1016/j.compchemeng.2010.11.010},
	author = {Inamdar, Satish R. and Karimi, I. A. and Parulekar, S. J. and Kulkarni, B. D.}
}
