Quantitative characterization of physico-chemical properties of the active layers of reverse osmosis and nanofiltration membranes, and their relation to membrane performance

The main objectives of this dissertation were: (i) to develop experimental and analytical procedures to quantify different physico-chemical properties of the ultra-thin (~ 100 nm) active layers of reverse osmosis (RO) and nanofiltration (NF) membranes and their interactions with contaminants; (ii) to use such procedures to evaluate the similarities and differences between the active layers of different RO/NF membranes; and (iii) to relate characterization results to membrane performance. Such objectives were motivated by the current limited understanding of the physico-chemical properties of active layers as a result of traditional characterization techniques having limitations associated with the nanometer-scale spatial resolution required to study these ultra-thin films. Functional groups were chosen as the main active layer property of interest. Specific accomplishments of this study include the development of procedures to quantify in active layers as a function of pH: (1) the concentration of both negatively and positively ionized functional groups; (2) the stoichiometry of association between ions (i.e., barium) and ionized functional groups (i.e., carboxylate and sulfonate); and (3) the steric effects experienced by ions (i.e., barium). Conceptual and mathematical models were developed to describe experimental results. The depth heterogeneity of the active layer physico-chemical properties and interactions with contaminants studied in this dissertation was also characterized. Additionally, measured concentrations of ionized functional groups in the polyamide active layers of several commercial RO/NF membranes were used as input in a simplified RO/NF transport model to predict the rejection of a strong electrolyte (i.e., potassium iodide) and a weak acid (i.e., arsenious acid) at different pH values based on rejection results at one pH condition. The good agreement between predicted and experimental results showed that the characterization procedures developed in this study serve as useful tools in the advancement of the understanding of the properties and structure of the active layers of RO/NF membranes, and the mechanisms of contaminant transport through them.

Exact Solution of Bayes and Minimax Change-Detection Problems

The challenge of detecting a change in the distribution of data is a sequential decision problem that is relevant to many engineering solutions, including quality control and machine and process monitoring. This dissertation develops techniques for exact solution of change-detection problems with discrete time and discrete observations. Change-detection problems are classified as Bayes or minimax based on the availability of information on the change-time distribution. A Bayes optimal solution uses prior information about the distribution of the change time to minimize the expected cost, whereas a minimax optimal solution minimizes the cost under the worst-case change-time distribution. Both types of problems are addressed. The most important result of the dissertation is the development of a polynomial-time algorithm for the solution of important classes of Markov Bayes change-detection problems. Existing techniques for epsilon-exact solution of partially observable Markov decision processes have complexity exponential in the number of observation symbols. A new algorithm, called constellation induction, exploits the concavity and Lipschitz continuity of the value function, and has complexity polynomial in the number of observation symbols. It is shown that change-detection problems with a geometric change-time distribution and identically- and independently-distributed observations before and after the change are solvable in polynomial time. Also, change-detection problems on hidden Markov models with a fixed number of recurrent states are solvable in polynomial time. A detailed implementation and analysis of the constellation-induction algorithm are provided. Exact solution methods are also established for several types of minimax change-detection problems. Finite-horizon problems with arbitrary observation distributions are modeled as extensive-form games and solved using linear programs. Infinite-horizon problems with linear penalty for detection delay and identically- and independently-distributed observations can be solved in polynomial time via epsilon-optimal parameterization of a cumulative-sum procedure. Finally, the properties of policies for change-detection problems are described and analyzed. Simple classes of formal languages are shown to be sufficient for epsilon-exact solution of change-detection problems, and methods for finding minimally sized policy representations are described.