An automated multi-unit composting facility for biodegradability evaluations

A system has been developed for studying the biodegradation of natural and synthetic polymeric material. The system is based on standard methods developed by the European Committee for Standardisation (CEN TC 261) (ISO/DIS 14855) and the American Society of Testing Materials, 'ASTM. Standard Test Method for Determining Aerobic. Biodegradation of Plastic Materials under Controlled Composting Conditions' (ASTM D 5338-92). A new low-cost compost facility has been used which satisfies the requirements of these standards. The system has been automated for data collection and has been run under the conditions specified by the standards. In the system, cellulose, newspaper and two starch-based polymers were treated with compost in a series of 3dm(3) vessels at 52 degreesC and under conditions of optimum moisture and pH. The degradation was followed over time by measuring the amount of carbon released as carbon dioxide. (C) 2001 Society of Chemical Industry.

The surface accessibility of the glycine receptor M2-M3 loop is increased in the channel open state

Mutations in the extracellular M2-M3 loop of the glycine receptor (GlyR) alpha1 subunit have been shown previously to affect channel gating. In this study, the substituted cysteine accessibility method was used to investigate whether a structural rearrangement of the M2-M3 loop accompanies GlyR activation. All residues from R271C to V277C were covalently modified by both positively charged methanethiosulfonate ethyltrimethylammonium (MTSET) and negatively charged methanethiosulfonate ethylsulfonate (MTSES), implying that these residues form an irregular surface loop. The MTSET modification rate of all residues from R271C to K276C was faster in the glycine-bound state than in the unliganded state. MTSES modification of A272C, L274C, and V277C was also faster in the glycine-bound state. These results demonstrate that the surface accessibility of the M2-M3 loop is increased as the channel transitions from the closed to the open state, implying that either the loop itself or an overlying domain moves during channel activation.

A multi-purpose rainfall simulator for field infiltration and erosion studies

This paper describes a rainfall simulator developed for field and laboratory studies that gives great flexibility in plot size covered, that is highly portable and able to be used on steep slopes, and that is economical in its water use. The simulator uses Veejet 80100 nozzles mounted on a manifold, with the nozzles controlled to sweep to and from across a plot width of 1.5 m. Effective rainfall intensity is controlled by the frequency with which the nozzles sweep. Spatial uniformity of rainfall on the plots is high, with coefficients of variation (CV) on the body of the plot being 8-10%. Use of the simulator for erosion and infiltration measurements is discussed.

Determining when the absolute state complexity of a Hermitian code achieves its DLP bound

Let g be the genus of the Hermitian function field H/F(q)2 and let C-L(D,mQ(infinity)) be a typical Hermitian code of length n. In [Des. Codes Cryptogr., to appear], we determined the dimension/length profile (DLP) lower bound on the state complexity of C-L(D,mQ(infinity)). Here we determine when this lower bound is tight and when it is not. For m less than or equal to n-2/2 or m greater than or equal to n-2/2 + 2g, the DLP lower bounds reach Wolf's upper bound on state complexity and thus are trivially tight. We begin by showing that for about half of the remaining values of m the DLP bounds cannot be tight. In these cases, we give a lower bound on the absolute state complexity of C-L(D,mQ(infinity)), which improves the DLP lower bound. Next we give a good coordinate order for C-L(D,mQ(infinity)). With this good order, the state complexity of C-L(D,mQ(infinity)) achieves its DLP bound (whenever this is possible). This coordinate order also provides an upper bound on the absolute state complexity of C-L(D,mQ(infinity)) (for those values of m for which the DLP bounds cannot be tight). Our bounds on absolute state complexity do not meet for some of these values of m, and this leaves open the question whether our coordinate order is best possible in these cases. A straightforward application of these results is that if C-L(D,mQ(infinity)) is self-dual, then its state complexity (with respect to the lexicographic coordinate order) achieves its DLP bound of n /2 - q(2)/4, and, in particular, so does its absolute state complexity.

A model of factors affecting an information system's change in state

Management are keen to maximize the life span of an information system because of the high cost, organizational disruption, and risk of failure associated with the re-development or replacement of an information system. This research investigates the effects that various factors have on an information system's life span by understanding how the factors affect an information system's stability. The research builds on a previously developed two-stage model of information system change whereby an information system is either in a stable state of evolution in which the information system's functionality is evolving, or in a state of revolution, in which the information system is being replaced because it is not providing the functionality expected by its users. A case study surveyed a number of systems within one organization. The aim was to test whether a relationship existed between the base value of the volatility index (a measure of the stability of an information system) and certain system characteristics. Data relating to some 3000 user change requests covering 40 systems over a 10-year period were obtained. The following factors were hypothesized to have significant associations with the base value of the volatility index: language level (generation of language of construction), system size, system age, and the timing of changes applied to a system. Significant associations were found in the hypothesized directions except that the timing of user changes was not associated with any change in the value of the volatility index. Copyright (C) 2002 John Wiley Sons, Ltd.

Lower Bounds on the State Complexity of Geometric Goppa Codes

We reinterpret the state space dimension equations for geometric Goppa codes. An easy consequence is that if deg G less than or equal to n-2/2 or deg G greater than or equal to n-2/2 + 2g then the state complexity of C-L(D, G) is equal to the Wolf bound. For deg G is an element of [n-1/2, n-3/2 + 2g], we use Clifford's theorem to give a simple lower bound on the state complexity of C-L(D, G). We then derive two further lower bounds on the state space dimensions of C-L(D, G) in terms of the gonality sequence of F/F-q. (The gonality sequence is known for many of the function fields of interest for defining geometric Goppa codes.) One of the gonality bounds uses previous results on the generalised weight hierarchy of C-L(D, G) and one follows in a straightforward way from first principles; often they are equal. For Hermitian codes both gonality bounds are equal to the DLP lower bound on state space dimensions. We conclude by using these results to calculate the DLP lower bound on state complexity for Hermitian codes.

High resolution 3-D imaging via multi-pass SAR

Spaceborne/airborne synthetic aperture radar (SAR) systems provide high resolution two-dimensional terrain imagery. The paper proposes a technique for combining multiple SAR images, acquired on flight paths slightly separated in the elevation direction, to generate high resolution three-dimensional imagery. The technique could be viewed as an extension to interferometric SAR (InSAR) in that it generates topographic imagery with an additional dimension of resolution. The 3-D multi-pass SAR imaging system is typically characterised by a relatively short ambiguity length in the elevation direction. To minimise the associated ambiguities we exploit the relative phase information within the set of images to track the terrain landscape. The SAR images are then coherently combined, via a nonuniform DFT, over a narrow (in elevation) volume centred on the 'dominant' terrain ground plane. The paper includes a detailed description of the technique, background theory, including achievable resolution, and the results of an experimental study.

Agents as multi-threaded logical objects

In this paper we describe a distributed object oriented logic programming language in which an object is a collection of threads deductively accessing and updating a shared logic program. The key features of the language, such as static and dynamic object methods and multiple inheritance, are illustrated through a series of small examples. We show how we can implement object servers, allowing remote spawning of objects, which we can use as staging posts for mobile agents. We give as an example an information gathering mobile agent that can be queried about the information it has so far gathered whilst it is gathering new information. Finally we define a class of co-operative reasoning agents that can do resource bounded inference for full first order predicate logic, handling multiple queries and information updates concurrently. We believe that the combination of the concurrent OO and the LP programming paradigms produces a powerful tool for quickly implementing rational multi-agent applications on the internet.

Efficient time-independent wave packet scattering calculations within a Lanczos subspace: H+O-2 (J=0) state-to-state reaction probabilities

An efficient Lanczos subspace method has been devised for calculating state-to-state reaction probabilities. The method recasts the time-independent wave packet Lippmann-Schwinger equation [Kouri , Chem. Phys. Lett. 203, 166 (1993)] inside a tridiagonal (Lanczos) representation in which action of the causal Green's operator is affected easily with a QR algorithm. The method is designed to yield all state-to-state reaction probabilities from a given reactant-channel wave packet using a single Lanczos subspace; the spectral properties of the tridiagonal Hamiltonian allow calculations to be undertaken at arbitrary energies within the spectral range of the initial wave packet. The method is applied to a H+O-2 system (J=0), and the results indicate the approach is accurate and stable. (C) 2002 American Institute of Physics.

Calculation of resonances and product state distributions for the unimolecular dissociation of H2S

Resonance phenomena associated with the unimolecular dissociation of H2S --> SH + H have been investigated quantum mechanically by the Lanczos homogeneous filter diagonalization method using a newly developed potential energy surface (J. Chem. Phys. 2001, 114, 320). Resonance energies, widths (rates), and product state distributions have been obtained. Both dissociation rates and product state distributions of SH show, strong fluctuations, indicating that the dissociation of H2S is essentially irregular. Statistical analysis of neighboring level spacing and width distributions also confirms this behavior. The dissociation rates and product state distributions are compared to the predictions of quantum phase space theory.

Chebyshev real wave packet propagation: H+O-2 (J=0) state-to-state reactive scattering calculations

In this paper we explore the relative performance of two recently developed wave packet methodologies for reactive scattering, namely the real wave packet Chebyshev domain propagation of Gray and Balint-Kurti [J. Chem. Phys. 108, 950 (1998)] and the Lanczos subspace wave packet approach of Smith [J. Chem. Phys. 116, 2354 (2002); Chem. Phys. Lett. 336, 149 (2001)]. In the former method, a modified Schrodinger equation is employed to propagate the real part of the wave packet via the well-known Chebyshev iteration. While the time-dependent wave packet from the modified Schrodinger equation is different from that obtained using the standard Schrodinger equation, time-to-energy Fourier transformation yields wave functions which differ only trivially by normalization. In the Lanczos subspace approach the linear system of equations defining the action of the Green operator may be solved via either time-dependent or time-independent methods, both of which are extremely efficient due to the simple tridiagonal structure of the Hamiltonian in the Lanczos representation. The two different wave packet methods are applied to three dimensional reactive scattering of H+O-2 (total J=0). State-to-state reaction probabilities, product state distributions, as well as initial-state-resolved cumulative reaction probabilities are examined. (C) 2002 American Institute of Physics.

Entanglement in the steady state of a collective-angular-momentum (Dicke) model

We model the behavior of an ion trap with all ions driven simultaneously and coupled collectively to a heat bath. The equations for this system are similar to the irreversible dynamics of a collective angular momentum system known as the Dicke model. We show how the steady state of the ion trap as a dissipative many-body system driven far from equilibrium can exhibit quantum entanglement. We calculate the entanglement of this steady state for two ions in the trap and in the case of more than two ions we calculate the entanglement between two ions by tracing over all the other ions. The entanglement in the steady state is a maximum for the parameter values corresponding roughly to a bifurcation of a fixed point in the corresponding semiclassical dynamics. We conjecture that this is a general mechanism for entanglement creation in driven dissipative quantum systems.