Onset of the Henry constant for supercritical adsorption into carbonaceous porous materials

The Henry constant is commonly used as a measure of how strong an adsorbate is attracted towards a solid surface and is regarded as one of the fundamental parameters in adsorption studies. Having a sound basis in thermodynamics, the Henry Law is often used as a criterion to evaluate the validity of adsorption isotherm equations. However, the application of the Henry Law for microporous materials, especially microporous activated carbon, remains questionable. It is the aim of this paper to examine the Henry Law behavior of supercritical adsorbates in carbonaceous pores of different sizes, and to define the conditions for the Henry Law to be applicable for carbonaceous adsorbents.

Surface diffusion of hydrocarbons in activated carbon: Comparison between constant molar flow, differential permeation and differential adsorption bed methods

This paper presents the comparison of surface diffusivities of hydrocarbons in activated carbon. The surface diffusivities are obtained from the analysis of kinetic data collected using three different kinetics methods- the constant molar flow, the differential adsorption bed and the differential permeation methods. In general the values of surface diffusivity obtained by these methods agree with each other, and it is found that the surface diffusivity increases very fast with loading. Such a fast increase can not be accounted for by a thermodynamic Darken factor, and the surface heterogeneity only partially accounts for the fast rise of surface diffusivity versus loading. Surface diffusivities of methane, ethane, propane, n-butane, n-hexane, benzene and ethanol on activated carbon are reported in this paper.

An algorithm to predict 3 ' intron splice sites in Plasmodium falciparum genomic sequences

A new algorithm, PfAGSS, for predicting 3' splice sites in Plasmodium falciparum genomic sequences is described. Application of this program to the published P. falciparum chromosome 2 and 3 data suggests that existing programs result in a high error rate in assigning 3' intron boundaries. (C) 2001 Elsevier Science B.V. All rights reserved.

Preprocessing and time-frequency analysis of newborn EEG seizures

Neurological disease or dysfunction in newborn infants is often first manifested by seizures. Prolonged seizures can result in impaired neurodevelopment or even death. In adults, the clinical signs of seizures are well defined and easily recognized. In newborns, however, the clinical signs are subtle and may be absent or easily missed without constant close observation. This article describes the use of adaptive signal processing techniques for removing artifacts from newborn electroencephalogram (EEG) signals. Three adaptive algorithms have been designed in the context of EEG signals. This preprocessing is necessary before attempting a fine time-frequency analysis of EEG rhythmical activities, such as electrical seizures, corrupted by high amplitude signals. After an overview of newborn EEG signals, the authors describe the data acquisition set-up. They then introduce the basic physiological concepts related to normal and abnormal newborn EEGs and discuss the three adaptive algorithms for artifact removal. They also present time-frequency representations (TFRs) of seizure signals and discuss the estimation and modeling of the instantaneous frequency related to the main ridge of the TFR.

A simulated annealing algorithm for finding consensus sequences

Motivation: A consensus sequence for a family of related sequences is, as the name suggests, a sequence that captures the features common to most members of the family. Consensus sequences are important in various DNA sequencing applications and are a convenient way to characterize a family of molecules. Results: This paper describes a new algorithm for finding a consensus sequence, using the popular optimization method known as simulated annealing. Unlike the conventional approach of finding a consensus sequence by first forming a multiple sequence alignment, this algorithm searches for a sequence that minimises the sum of pairwise distances to each of the input sequences. The resulting consensus sequence can then be used to induce a multiple sequence alignment. The time required by the algorithm scales linearly with the number of input sequences and quadratically with the length of the consensus sequence. We present results demonstrating the high quality of the consensus sequences and alignments produced by the new algorithm. For comparison, we also present similar results obtained using ClustalW. The new algorithm outperforms ClustalW in many cases.

Development and survival of the diamondback moth (Lepidoptera : Plutellidae) at constant and alternating temperatures

Survival and development time from egg to adult emergence of the diamondback moth, Plutella xylostella (L.), were determined at 19 constant and 14 alternating temperature regimes from 4 to 40degreesC. Plutella xylostella developed successfully front egg to adult emergence at constant temperatures from 8 to 32degreesC. At temperatures from 4 to 6degreesC or from 34 to 40degreesC, partial or complete development of individual stages or instars was possible, with third and fourth instars having the widest temperature limits. The insect developed successfully from egg to adult emergence under alternating regimes including temperatures as low as 4degreesC or as high as 38degreesC. The degree-day model, the logistic equation, and the Wang model were used to describe the relationships between temperature and development rate at both constant and alternating temperatures. The degree-day model described the relationships well from 10 to 30degreesC. The logistic equation and the Wang model fit the data well at temperatures 32degreesC. Under alternating regimes, all three models gave good simulations of development in the mid-temperature range, but only the logistic equation gave close simulations in the low temperature range, and none gave close or consistent simulations in the high temperature range. The distribution of development time was described satisfactorily by a Weibull function. These rate and time distribution functions provide tools for simulating population development of P. xylostella over a wide range of temperature conditions.

A monolithic smoothing-gap algorithm for contact-impact based on the signed distance function

A new algorithm has been developed for smoothing the surfaces in finite element formulations of contact-impact. A key feature of this method is that the smoothing is done implicitly by constructing smooth signed distance functions for the bodies. These functions are then employed for the computation of the gap and other variables needed for implementation of contact-impact. The smoothed signed distance functions are constructed by a moving least-squares approximation with a polynomial basis. Results show that when nodes are placed on a surface, the surface can be reproduced with an error of about one per cent or less with either a quadratic or a linear basis. With a quadratic basis, the method exactly reproduces a circle or a sphere even for coarse meshes. Results are presented for contact problems involving the contact of circular bodies. Copyright (C) 2002 John Wiley Sons, Ltd.

A subset-oriented algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries

Libraries of cyclic peptides are being synthesized using combinatorial chemistry for high throughput screening in the drug discovery process. This paper describes the min_syn_steps.cpp program (available at http://www.imb.uq.edu.au/groups/smythe/tran), which after inputting a list of cyclic peptides to be synthesized, removes cyclic redundant sequences and calculates synthetic strategies which minimize the synthetic steps as well as the reagent requirements. The synthetic steps and reagent requirements could be minimized by finding common subsets within the sequences for block synthesis. Since a brute-force approach to search for optimum synthetic strategies is impractically large, a subset-orientated approach is utilized here to limit the size of the search. (C) 2002 Elsevier Science Ltd. All rights reserved.

An augmented Lanczos algorithm for the efficient computation of a dot-product of a function of a large sparse symmetric matrix

The Lanczos algorithm is appreciated in many situations due to its speed. and economy of storage. However, the advantage that the Lanczos basis vectors need not be kept is lost when the algorithm is used to compute the action of a matrix function on a vector. Either the basis vectors need to be kept, or the Lanczos process needs to be applied twice. In this study we describe an augmented Lanczos algorithm to compute a dot product relative to a function of a large sparse symmetric matrix, without keeping the basis vectors.

The tree cut and merge algorithm for estimation of network reliability

This article presents Monte Carlo techniques for estimating network reliability. For highly reliable networks, techniques based on graph evolution models provide very good performance. However, they are known to have significant simulation cost. An existing hybrid scheme (based on partitioning the time space) is available to speed up the simulations; however, there are difficulties with optimizing the important parameter associated with this scheme. To overcome these difficulties, a new hybrid scheme (based on partitioning the edge set) is proposed in this article. The proposed scheme shows orders of magnitude improvement of performance over the existing techniques in certain classes of network. It also provides reliability bounds with little overhead.

Postbuckling of piezoelectric FGM plates subject to thermo-electro-mechanical loading

In this paper, we examine the postbuckling behavior of functionally graded material FGM rectangular plates that are integrated with surface-bonded piezoelectric actuators and are subjected to the combined action of uniform temperature change, in-plane forces, and constant applied actuator voltage. A Galerkin-differential quadrature iteration algorithm is proposed for solution of the non-linear partial differential governing equations. To account for the transverse shear strains, the Reddy higher-order shear deformation plate theory is employed. The bifurcation-type thermo-mechanical buckling of fully clamped plates, and the postbuckling behavior of plates with more general boundary conditions subject to various thermo-electro-mechanical loads, are discussed in detail. Parametric studies are also undertaken, and show the effects of applied actuator voltage, in-plane forces, volume fraction exponents, temperature change, and the character of boundary conditions on the buckling and postbuckling characteristics of the plates. (C) 2003 Elsevier Science Ltd. All rights reserved.