Bench Scale Studies of the Soil Aeration Process for Bioremediation of Petroleum Hydrocarbons

An alternative to traditional hydrocarbon bioremediation is to pump air through unsaturated soils to create aerobic conditions and induce biodegradation. This study examines the effects of moisture and nutrient augmentation on biodegradation of petroleum hydrocarbons in aerated soils. Findings indicate that forced aeration, coupled with additions of nutrients and moisture, stimulate hydrocarbon-degrading microorganisms and present a feasible approach to bioremediation management.     

A novel process for anaerobic composting of municipal solid waste

A novel process has been developed and evaluated in a pilotscale program for conversion of the biodegradable fraction of municipal solid waste (MSW) to methane via anaerobic composting. The sequential batch anaerobic composting (SEBAC) process employs leachate management to provide organisms, moisture, and nutrients required for rapid conversion of MSW and removal of inhibitory fermentation products during start-up. The biodegradable organic materials are converted to methane and carbon dioxide in 21–42 d, rather than the years required in landfills.     

Endothermic ion molecule reactions

Endothermic ion-molecule reactions in a tandem mass spectrometer have been used for a number of years for determining thermodynamic quantities, such as heats of formation and proton affinities, for gaseous ions. Recently, the reactive, endothermic collision has been exploited as an analytical technique for the structural analysis of peptides and other biomolecules. The technique is based upon the endothermic transfer of protons associated with amide bonds to ammonia. This reaction proceeds via a long-lived collision complex. When additional beam energy is supplied, other dissociation channels are opened up, leading to the production of sequence ions for the mass-selected, protonated analyte that are normally observed in high energy collision-induced dissociation spectra. The advantage, however, is that such spectra can be produced at very low beam energies. In this article, the rationale for developing this scheme, and its roots in previous ion-molecule studies, are explored.     

Benchmark studies of the BCRLM reactive scattering code: Implications for accurate quantum calculations

Summary The Bending Corrected Rotating Linear Model (BCRLM), developed by Hayes and Walker, is a simple approximation to the true multidimensional scattering problem for reactions of the type: A + BC AB + C. While the BCRLM method is simpler than methods designed to obtain accurate three-dimensional quantum scattering results, this turns out to be a major advantage in terms of our benchmarking studies. The computer code used to obtain BCRLM scattering results is written for the most part in standard FORTRAN and has been ported to several scalar, vector, and parallel architecture computers including the IBM 3090-600J, the Cray XMP and YMP, the Ardent Titan, IBM RISC System/6000, Convex C-1 and the MIPS 2000. Benchmark results will be reported for each of these machines with an emphasis on comparing the scalar, vector, and parallel performance for the standard code with minimum modifications. Detailed analysis of the mapping of the BCRLM approach onto both shared and distributed memory parallel architecture machines indicates the importance of introducing several key changes in the basic strategy and algorithms used to calculate scattering results. This analysis of the BCRLM approach provides some insights into optimal strategies for mapping three-dimensional quantum scattering methods, such as the Parker-Pack method, onto shared or distributed memory parallel computers.     

A potential-function reduction algorithm for solving a linear program directly from an infeasible “warm start”

This paper develops an algorithm for solving a standard-form linear program directly from an infeasible “warm start”, i.e., directly from a given infeasible solution \(\hat x\) that satisfies \(A\hat x = b\) but \(\hat x \ngeqslant 0\) . The algorithm is a potential function reduction algorithm, but the potential function is somewhat different than other interior-point method potential functions, and is given by $$F(x,B) = q\ln (c^T x - B) - \sum\limits_{j = 1}^n {\ln (x_j + h_j (c^T x - B))}$$ where \(q = n + \sqrt n\) is a given constant,h is a given strictly positive shift vector used to shift the nonnegativity constaints, andB is a lower bound on the optimal value of the linear program. The duality gapc ^T x ? B is used both in the leading term as well as in the barrier term to help shift the nonnegativity constraints. The algorithm is shown under suitable conditions to achieve a constant decrease in the potential function and so achieves a constant decrease in the duality gap (and hence also in the infeasibility) in O(n) iterations. Under more restrictive assumptions regarding the dual feasible region, this algorithm is modified by the addition of a dual barrier term, and will achieve a constant decrease in the duality gap (and in the infeasibility) in \(O(\sqrt n )\) iterations.     

Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function

This paper presents extensions and further analytical properties of algorithms for linear programming based only on primal scaling and projected gradients of a potential function. The paper contains extensions and analysis of two polynomial-time algorithms for linear programming. We first present an extension of Gonzaga's O(nL) iteration algorithm, that computes dual variables and does not assume a known optimal objective function value. This algorithm uses only affine scaling, and is based on computing the projected gradient of the potential function $$q\ln (x^T s) - \sum\limits_{j = 1}^n {\ln (x_j )} $$ wherex is the vector of primal variables ands is the vector of dual slack variables, and q = n + \(\sqrt n \) . The algorithm takes either a primal step or recomputes dual variables at each iteration. We next present an alternate form of Ye's O( \(\sqrt n \) L) iteration algorithm, that is an extension of the first algorithm of the paper, but uses the potential function $$q\ln (x^T s) - \sum\limits_{j = 1}^n {\ln (x_j ) - \sum\limits_{j - 1}^n {\ln (s_j )} } $$ where q = n + \(\sqrt n \) . We use this alternate form of Ye's algorithm to show that Ye's algorithm is optimal with respect to the choice of the parameterq in the following sense. Suppose thatq = n + n ^t wheret?0. Then the algorithm will solve the linear program in O(n ^r L) iterations, wherer = max{t, 1 ? t}. Thus the value oft that minimizes the complexity bound ist = 1/2, yielding Ye's O( \(\sqrt n \) L) iteration bound.     

Elementary abelian p-subgroups of algebraic groups

Let be an algebraically closed field and let G be a finite-dimensional algebraic group over which is nearly simple, i.e. the connected component of the identity G ⁰ is perfect, C _G(G ⁰)=Z(G ⁰) and G ⁰/Z(G ⁰) is simple. We classify maximal elementary abelian p-subgroups of G which consist of semisimple elements, i.e. for all primes p char .Call a group quasisimple if it is perfect and is simple modulo the center. Call a subset of an algebraic group toral if it is in a torus; otherwise nontoral. For several quasisimple algebraic groups and p=2, we define complexity, and give local criteria for whether an elementary abelian 2-subgroup of G is toral.For all primes, we analyze the nontoral examples, include a classification of all the maximal elementary abelian p-groups, many of the nonmaximal ones, discuss their normalizers and fusion (i.e. how conjugacy classes of the ambient algebraic group meet the subgroup). For some cases, we give a very detailed discussion, e.g. p=3 and G of type E ₆, E ₇ and E ₈. We explain how the presence of spin up and spin down elements influences the structure of projectively elementary abelian 2-groups in Spin(2n, ). Examples of an elementary abelian group which is nontoral in one algebraic group but toral in a larger one are noted.Two subsets of a maximal torus are conjugate in G iff they are conjugate in the normalizer of the torus; this observation, with our discussion of the nontoral cases, gives a detailed guide to the possibilities for the embedding of an elementary abelian p-group in G. To give an application of our methods, we study extraspecial p-groups in E ₈( ).Dedicated to Jacques Tits for his sixtieth birthday     

Interface interactions in modulated phases,and upsilon points

Certain features in Frenkel-Kontorova and other models of phases with a one-dimensional modulation can be analyzed by assuming parallel interfaces separating sets of lattice planes belonging to two different phases, and treating the free energy to create interfaces, as well as the interaction of two, three, or more interfaces, as phenomenological parameters. A strategy employed by Fisher and Szpilka for interacting defects can be extended to the case of interfaces, allowing a systematic study of the phase diagram by ignoring all interface interactions, and then successively taking into account pair, triple, and higher-order terms. The possible phase diagrams which can occur near the point where =0 include: various sorts of endpoints analogous to critical endpoints, an accumulation point of first-order transitions and triple points, and a self-similar structure which we call an upsilon point, which turns out to be an accumulation point of an infinite number of segments of first-order transition lines, each of which terminates in two upsilon points.     

Order-disorder effects of small guests in clathrates studied by nuclear quadrupole resonance and crystallography. Part I. Carbon tetrachloride and related molecules in Ni(SCN)2(3-methylpyridine)4

NQR spectroscopy and X-ray crystallography have been jointly applied to the study of the small guest molecules CH₂Cl₂, CHCl₃, CCl₄, CBr₂Cl₂, C(CH₃)2Cl₂ etc. in the Werner host complex Ni(SCN)₂(3-methylpyridine)₄. Specific host-guest dipole-dipole interactions play an important role in order-disorder effects for guest molecules in the cavities of orthorhombic system,Fddd. Thus a weakly polar molecule such as CBr₂Cl₂ exhibits a disordered alternation, both the bromine and the chlorine atoms occupying the two possible sites in theC ₂ cavity, whereas for the polar molecule C(CH₃)₂Cl₂, an ordered structure is observed. In addition, two new types of crystal structures,C2/c andP , are reported here for dichloromethane and chloroform clathrates.     

A partially observed control problem for Markov chains

A finite state, continuous time Markov chain is considered and the solution to the filtering problem given when the observation process counts the total number of jumps. The Zakai equation for the unnormalized conditional distribution is obtained and the control problem discussed in separated form with this as the state. A new feature is that, because of the correlation between the state and observation process, the control parameter appears in the diffusion coefficient which multiplies the Poisson noise in the Zakai equation. By introducing a Gâteaux derivative the minimum principle, satisfied by an optimal control, is derived. If the optimal control is Markov, a stochastic integrand can be obtained more explicitly and new forward and backward equations satisfied by the adjoint process are obtained.This research was partially supported by NSERC Grant A7964, the Air Force Office of Scientific Research, United States Air Force, under Contract AFOSR-86-0332, and the U.S. Army Research Office under Contract DAAL03-87-0102.