Evaluation of the profitability of fast-growing tropical trees.

The profitability of fast-growing trees was investigated in the northeastern and eastern provinces of Thailand. The financial, economic, and tentative environmental-economic profitability was determined separately for three fast-growing plantation tree species and for three categories of plantation managers: the private industry, the state (the Royal Forest Department) and the farmers. Fast-growing tree crops were also compared with teak (Tectona grandis), a traditional medium or long rotation species, and Para rubber (Hevea brasiliensis) which presently is the most common cultivated tree in Thailand. The optimal rotation for Eucalyptus camaldulensis pulpwood production was eight years. This was the most profitable species in pulpwood production. In sawlog production Acacia mangium and Melia azedarach showed a better financial profitability. Para rubber was more profitable and teak less profitable than the three fast-growing species. The economic profitability was higher than the financial one, and the tentative environmental-economic profitability was slightly higher than the economic profitability. The profitability of tree growing is sensitive to plantation yields and labour cost changes and especially to wood prices. Management options which aim at pulpwood production are more sensitive to input or output changes than those options which include sawlog production. There is an urgent need to improve the growth and yield data and to study the environmental impacts of tree plantations for all species and plantation types.

Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks

We present a distributed algorithm that finds a maximal edge packing in O(Δ + log* W) synchronous communication rounds in a weighted graph, independent of the number of nodes in the network; here Δ is the maximum degree of the graph and W is the maximum weight. As a direct application, we have a distributed 2-approximation algorithm for minimum-weight vertex cover, with the same running time. We also show how to find an f-approximation of minimum-weight set cover in O(f2k2 + fk log* W) rounds; here k is the maximum size of a subset in the set cover instance, f is the maximum frequency of an element, and W is the maximum weight of a subset. The algorithms are deterministic, and they can be applied in anonymous networks.

Immunochemical analysis of prolamins in gluten-free foods

People with coeliac disease have to maintain a gluten-free diet, which means excluding wheat, barley and rye prolamin proteins from their diet. Immunochemical methods are used to analyse the harmful proteins and to control the purity of gluten-free foods. In this thesis, the behaviour of prolamins in immunological gluten assays and with different prolamin-specific antibodies was examined. The immunoassays were also used to detect residual rye prolamins in sourdough systems after enzymatic hydrolysis and wheat prolamins after deamidation. The aim was to characterize the ability of the gluten analysis assays to quantify different prolamins in varying matrices in order to improve the accuracy of the assays. Prolamin groups of cereals consist of a complex mixture of proteins that vary in their size and amino acid sequences. Two common characteristics distinguish prolamins from other cereal proteins. Firstly, they are soluble in aqueous alcohols, and secondly, most of the prolamins are mainly formed from repetitive amino acid sequences containing high amounts of proline and glutamine. The diversity among prolamin proteins sets high requirements for their quantification. In the present study, prolamin contents were evaluated using enzyme-linked immunosorbent assays based on ω- and R5 antibodies. In addition, assays based on A1 and G12 antibodies were used to examine the effect of deamidation on prolamin proteins. The prolamin compositions and the cross-reactivity of antibodies with prolamin groups were evaluated with electrophoretic separation and Western blotting. The results of this thesis research demonstrate that the currently used gluten analysis methods are not able to accurately quantify barley prolamins, especially when hydrolysed or mixed in oats. However, more precise results can be obtained when the standard more closely matches the sample proteins, as demonstrated with barley prolamin standards. The study also revealed that all of the harmful prolamins, i.e. wheat, barley and rye prolamins, are most efficiently extracted with 40% 1-propanol containing 1% dithiothreitol at 50 °C. The extractability of barley and rye prolamins was considerably higher with 40% 1-propanol than with 60% ethanol, which is typically used for prolamin extraction. The prolamin levels of rye were lowered by 99.5% from the original levels when an enzyme-active rye-malt sourdough system was used for prolamin degradation. Such extensive degradation of rye prolamins suggest the use of sourdough as a part of gluten-free baking. Deamidation increases the diversity of prolamins and improves their solubility and ability to form structures such as emulsions and foams. Deamidation changes the protein structure, which has consequences for antibody recognition in gluten analysis. According to the resuts of the present work, the analysis methods were not able to quantify wheat gluten after deamidation except at very high concentrations. Consequently, deamidated gluten peptides can exist in food products and remain undetected, and thus cause a risk for people with gluten intolerance. The results of this thesis demonstrate that current gluten analysis methods cannot accurately quantify prolamins in all food matrices. New information on the prolamins of rye and barley in addition to wheat prolamins is also provided in this thesis, which is essential for improving gluten analysis methods so that they can more accurately quantify prolamins from harmful cereals.

Performance of a pipelined ring algorithm for Fast Fourier Transform on transputer arrays

In this paper a pipelined ring algorithm is presented for efficient computation of one and two dimensional Fast Fourier Transform (FFT) on a message passing multiprocessor. The algorithm has been implemented on a transputer based system and experiments reveal that the algorithm is very efficient. A model for analysing the performance of the algorithm is developed from its computation-communication characteristics. Expressions for execution time, speedup and efficiency are obtained and these expressions are validated with experimental results obtained on a four transputer system. The analytical model is then used to estimate the performance of the algorithm for different number of processors, and for different sizes of the input data.

Fast algorithm for data exchange in reconfigurable tree structures

This paper presents a fast algorithm for data exchange in a network of processors organized as a reconfigurable tree structure. For a given data exchange table, the algorithm generates a sequence of tree configurations in which the data exchanges are to be executed. A significant feature of the algorithm is that each exchange is executed in a tree configuration in which the source and destination nodes are adjacent to each other. It has been proved in a theorem that for every pair of nodes in the reconfigurable tree structure, there always exists two and only two configurations in which these two nodes are adjacent to each other. The algorithm utilizes this fact and determines the solution so as to optimize both the number of configurations required and the time to perform the data exchanges. Analysis of the algorithm shows that it has linear time complexity, and provides a large reduction in run-time as compared to a previously proposed algorithm. This is well-confirmed from the experimental results obtained by executing a large number of randomly-generated data exchange tables. Another significant feature of the algorithm is that the bit-size of the routing information code is always two bits, irrespective of the number of nodes in the tree. This not only increases the speed of the algorithm but also results in simpler hardware inside each node.

Fast computation of Legendre and Zernike moments

This paper presents recursive algorithms for fast computation of Legendre and Zernike moments of a grey-level image intensity distribution. For a binary image, a contour integration method is developed for the evaluation of Legendre moments using only the boundary information. A method for recursive calculation of Zernike polynomial coefficients is also given. A square-to-circular image transformation scheme is introduced to minimize the computation involved in Zernike moment functions. The recursive formulae can also be used in inverse moment transforms to reconstruct the original image from moments. The mathematical framework of the algorithms is given in detail, and illustrated with binary and grey-level images.

(PEG)(x)NH4ClO4: A new polymeric fast proton conductor

A new polymer electrolyte (PEG)(x) NH4ClO4(x = 5, 10, 15, 20) has been prepared that shows protonic conduction. The room temperature conductivities are of the order of 10(-7) S/cm, and increase with decrease in salt concentration. NMR line width studies indicate fairly low glass transition temperatures of the polymer salt complexes.

How fast is ultrafast chemistry

The field of ultrafast chemistry has seen a string of remarkable discoveries in the recent years. In this article we briefly discuss some of the problems solved recently. The understanding that has emerged from these studies has important consequences non only in chemistry but also in diverse biological processes.

Fast-Group-Decodable STBCs via Codes over GF(4)

In this paper we construct low decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condition is shown to be easily checked by transferring the problem to $\mathbb{F}_4$ domain. The problem of constructing low decoding complexity STBCs is shown to be equivalent to finding certain codes over $\mathbb{F}_4$. It is shown that almost all known low complexity STBCs can be obtained by this approach. New codes are given that have the least known decoding complexity in particular ranges of rate.

A fast quasi-Newton method for semi-supervised SVM

Due to its wide applicability, semi-supervised learning is an attractive method for using unlabeled data in classification. In this work, we present a semi-supervised support vector classifier that is designed using quasi-Newton method for nonsmooth convex functions. The proposed algorithm is suitable in dealing with very large number of examples and features. Numerical experiments on various benchmark datasets showed that the proposed algorithm is fast and gives improved generalization performance over the existing methods. Further, a non-linear semi-supervised SVM has been proposed based on a multiple label switching scheme. This non-linear semi-supervised SVM is found to converge faster and it is found to improve generalization performance on several benchmark datasets. (C) 2010 Elsevier Ltd. All rights reserved.

High-pressure studies on lithium fast-ion conductors

The variation of resistivity of the lithium fast-ion conductor Li3+y Ge1−yO4 (y = 0.25, 0.6, 0.72) has been studied with hydrostatic pressure up to 70 kbar and compared with that of Li16−2x Znx (GeO4)4(x = 1, 2). Both types showed pronounced resistivity maxima between 20–30 kbar and marked decrease thereafter. Measurements as a function of temperature between 120–300 K permitted the determination of activation energies and prefactors that also showed corresponding maxima. The activation volumes (ΔV) of the first type of compound varied between 4.34 to −4.90 cm3/mol at 300 K and decreased monotonically with increasing temperature. For the second type ΔV was much smaller, varied with pressure between 0.58 and −0.24 cm3/mol, and went through a maximum with increasing temperature. High-pressure studies were also conducted on aged samples, and the results are discussed in conjunction with results of impedance measurements and nuclear magnetic resonance (NMR) studies. The principal effect of pressure appears to be variations of the sum of interatomic potentials and hence barrier height, which also causes significant changes in entropy.