Characterization of soluble and bound EPS obtained from 2 submerged membrane bioreactors by 3D-EEM and HPSEC

This research study deals with the quantification and characterization of the EPS obtained from two 25 L bench scale membrane bioreactors (MBRs) with micro-(MF-MBR) and ultrafiltration (UF-MBR) submerged membranes. Both reactors were fed with synthetic water and operated for 168 days without sludge extraction, increasing their mixed liquor suspended solid (MLSS) concentration during the experimentation time. The characterization of soluble EPS (EPSs) was achieved by the centrifugation of mixed liquor and bound EPS (EPSb) by extraction using a cationic resin exchange (CER). EPS characterization was carried out by applying the 3-dimensional excitation–emission matrix fluorescence spectroscopy (3D-EEM) and high-performance size exclusion chromatography (HPSEC) with the aim of obtaining structural and functional information thereof. With regard to the 3D-EEM analysis, fluorescence spectra of EPSb and EPSs showed 2 peaks in both MBRs at all the MLSS concentrations studied. The peaks obtained for EPSb were associated to soluble microbial by-product-like (predominantly protein-derived compounds) and to aromatic protein. For EPSs, the peaks were associated with humic and fulvic acids. In both MBRs, the fluorescence intensity (FI) of the peaks increased as MLSS and protein concentrations increased. The FI of the EPSs peaks was much lower than for EPSb. It was verified that the evolution of the FI clearly depends on the concentration of protein and humic acids for EPSb and EPSs, respectively. Chromatographic analysis showed that the intensity of the EPSb peak increased while the concentrations of MLSS did. Additionally, the mean MW calculated was always higher the higher the MLSS concentrations in the reactors. MW was higher for the MF-MBR than for the UF-MBR for the same MLSS concentrations demonstrating that the filtration carried out with a UF membrane lead to retentions of lower MW particles.

Local job descriptions for two establishments in the malt liquor manufacturing industry : Malting Branch and Brewery Branch /

At head of title: Preliminary job study no. 5-113.

Science and technology; a purchase guide for branch and small public libraries.

Accompanied by "Supplement 1963." (42 L.) Published: [Pittsburgh, Carnegie Library of Pittsburgh, 1964?]

Rules and regulations of Plant Pest Control Branch and Plant Quarantine Branch. Title 7, Chapter III, of the Code of Federal Regulations.

Amendments [issued by Plant Quarantine Division or Plant Pest Control Division.] (1 v. loose-leaf)

Stray subjects, arrested and bound over. Being the fugitive offspring of the "old 'un" and the "young 'un," that have been "lying round loose," and are now "tied up" for fast keeping.

"Hamilton 645 (2)"

The Vaughn Branch and Old Edwardsville Road sites : late Stirling and early Moorehead phase Mississippian occupations in the northern American Bottom /

Includes bibliographical references (p. 413-431).

Collected and bound

Mode of access: Internet.

Working agreement - woods between Weyerhauser Timber Company, Longview Branch, and Lumber and Sawmill Workers, Local union No. 2642, April l5, 1937.

Mode of access: Internet.

Typical case behaviour of spin systems in random graph and composite ensembles

This thesis includes analysis of disordered spin ensembles corresponding to Exact Cover, a multi-access channel problem, and composite models combining sparse and dense interactions. The satisfiability problem in Exact Cover is addressed using a statistical analysis of a simple branch and bound algorithm. The algorithm can be formulated in the large system limit as a branching process, for which critical properties can be analysed. Far from the critical point a set of differential equations may be used to model the process, and these are solved by numerical integration and exact bounding methods. The multi-access channel problem is formulated as an equilibrium statistical physics problem for the case of bit transmission on a channel with power control and synchronisation. A sparse code division multiple access method is considered and the optimal detection properties are examined in typical case by use of the replica method, and compared to detection performance achieved by interactive decoding methods. These codes are found to have phenomena closely resembling the well-understood dense codes. The composite model is introduced as an abstraction of canonical sparse and dense disordered spin models. The model includes couplings due to both dense and sparse topologies simultaneously. The new type of codes are shown to outperform sparse and dense codes in some regimes both in optimal performance, and in performance achieved by iterative detection methods in finite systems.

Pair breaking and bound states in disordered superconductors

We study the effects of inhomogeneous pairing interactions and impurities in short-coherence-length superconductors. Within the Born approximation, the effects of pairing disorder and magnetic impurities are identical. The T-matrices for pairing disorder sites with and without an impurity give rise to bound states within the BCS (Bardeen-Cooper-Schrieffer) gap, consistent with scanning tunnelling microscopy results on Bi2Sr2CaCu2O8+δ with Zn or Ni impurities.

Rigid and non-rigid point-based medical image registration

The primary goal of this dissertation is to develop point-based rigid and non-rigid image registration methods that have better accuracy than existing methods. We first present point-based PoIRe, which provides the framework for point-based global rigid registrations. It allows a choice of different search strategies including (a) branch-and-bound, (b) probabilistic hill-climbing, and (c) a novel hybrid method that takes advantage of the best characteristics of the other two methods. We use a robust similarity measure that is insensitive to noise, which is often introduced during feature extraction. We show the robustness of PoIRe using it to register images obtained with an electronic portal imaging device (EPID), which have large amounts of scatter and low contrast. To evaluate PoIRe we used (a) simulated images and (b) images with fiducial markers; PoIRe was extensively tested with 2D EPID images and images generated by 3D Computer Tomography (CT) and Magnetic Resonance (MR) images. PoIRe was also evaluated using benchmark data sets from the blind retrospective evaluation project (RIRE). We show that PoIRe is better than existing methods such as Iterative Closest Point (ICP) and methods based on mutual information. We also present a novel point-based local non-rigid shape registration algorithm. We extend the robust similarity measure used in PoIRe to non-rigid registrations adapting it to a free form deformation (FFD) model and making it robust to local minima, which is a drawback common to existing non-rigid point-based methods. For non-rigid registrations we show that it performs better than existing methods and that is less sensitive to starting conditions. We test our non-rigid registration method using available benchmark data sets for shape registration. Finally, we also explore the extraction of features invariant to changes in perspective and illumination, and explore how they can help improve the accuracy of multi-modal registration. For multimodal registration of EPID-DRR images we present a method based on a local descriptor defined by a vector of complex responses to a circular Gabor filter.

Branch and price solution approach for order acceptance and capacity planning in make -to -order operations

The increasing emphasis on mass customization, shortened product lifecycles, synchronized supply chains, when coupled with advances in information system, is driving most firms towards make-to-order (MTO) operations. Increasing global competition, lower profit margins, and higher customer expectations force the MTO firms to plan its capacity by managing the effective demand. The goal of this research was to maximize the operational profits of a make-to-order operation by selectively accepting incoming customer orders and simultaneously allocating capacity for them at the sales stage. ^ For integrating the two decisions, a Mixed-Integer Linear Program (MILP) was formulated which can aid an operations manager in an MTO environment to select a set of potential customer orders such that all the selected orders are fulfilled by their deadline. The proposed model combines order acceptance/rejection decision with detailed scheduling. Experiments with the formulation indicate that for larger problem sizes, the computational time required to determine an optimal solution is prohibitive. This formulation inherits a block diagonal structure, and can be decomposed into one or more sub-problems (i.e. one sub-problem for each customer order) and a master problem by applying Dantzig-Wolfe’s decomposition principles. To efficiently solve the original MILP, an exact Branch-and-Price algorithm was successfully developed. Various approximation algorithms were developed to further improve the runtime. Experiments conducted unequivocally show the efficiency of these algorithms compared to a commercial optimization solver.^ The existing literature addresses the static order acceptance problem for a single machine environment having regular capacity with an objective to maximize profits and a penalty for tardiness. This dissertation has solved the order acceptance and capacity planning problem for a job shop environment with multiple resources. Both regular and overtime resources is considered. ^ The Branch-and-Price algorithms developed in this dissertation are faster and can be incorporated in a decision support system which can be used on a daily basis to help make intelligent decisions in a MTO operation.^