Kinetic of CO2 absorption and carbamate formation in aqueous solutions of diethanolamine

The absorption rates of CO₂ into aqueous solutions of Diethanolamine (DEA) with varying concentrations from 0.2 to 4M and temperature range from 293 to 323 K were measured by using a laboratory stirred reactor. The CO₂ partial pressure was varied in a range that the reaction would occur in pseudo first order regime. Experimental data were analyzed and the kinetic parameters associated with the reaction were determined. The activation energy for the deprotonation of the intermediate zwitterion was estimated at about 11.4 kcal/mol. The contribution of carbamate formation to the overall absorbed CO₂ was experimentally evaluated and found to be of the order of 100%.     

Handwritten word recognition with character and inter-characterneural networks

An off-line handwritten word recognition system is described. Images of handwritten words are matched to lexicons of candidate strings. A word image is segmented into primitives. The best match between sequences of unions of primitives and a lexicon string is found using dynamic programming. Neural networks assign match scores between characters and segments. Two particularly unique features are that neural networks assign confidence that pairs of segments are compatible with character confidence assignments and that this confidence is integrated into the dynamic programming. Experimental results are provided on data from the U.S. Postal Service.     

Bayes estimators for reliability measures in geometric distribution model using masked system life test data

This paper presents Bayes estimators for the reliability measures of the individual components in a multi-component systems in the presence of masked system life test data. The life time distributions of the system components are assumed to be geometric with different parameters. Two-sided Bayesian probability intervals of the parameters are also derived. Numerical simulation study is given in order to: (i) explain how one can apply the theoretical results obtained, (ii) study the influence of the sample size and masking level on the accuracy of point estimates.     

Mechanical properties of iron processed by severe plastic deformation

In the present study, the mechanical properties of Fe processed via severe plastic deformation (equal-channel angular pressing (ECAP)) at room temperature were investigated for the first time. The grain size of annealed Fe, with an initial grain size of about 200 μm, was reduced drastically during ECAP. After eight passes, the grain size reaches 200 to 400 nm, as documented by means of transmission electron microscopy (TEM). The value of microhardness during pressing increases 3 times over that of the starting material after the first pass and increases slightly during subsequent pressing for higher-purity Fe. Examination of the value of microhardness after eight passes as a function of post-ECAP annealing temperature shows a transition from recovery to recrystallization, an observation that resembles the behavior reported for heavily deformed metals and alloys. The tensile and compression behaviors were examined. In tension, a drop in the engineering stress-engineering strain curve beyond maximum load was observed both in the annealed Fe and the ECAP Fe. This drop is related to the neck deformation. The fracture surface, examined by scanning electron microscopy (SEM), shows vein patterns, which is different from the dimples found on the fracture surface of annealed Fe. In compression, an initial strain-hardening region followed by a no-strain-hardening region was observed in the ECAP Fe. The yield strength in tension of the ECAP Fe was observed to be higher than that in compression. The strengthening mechanisms and softening behavior are discussed.     

A Unified Framework for Designing, Implementing and Visualizing Distributed Algorithms

We present a general method and a toolkit for designing, implementing and visualizing distributed algorithms. We make use of the high level encoding of distributed algorithms as graph rewriting systems. The result is a unified and simple framework for describing, implementing and visualizing a large family of distributed algorithms.