Rank-Augmented LU-Algorithm for Computing Generalized Matrix Inverses

A rank-augmnented LU-algorithm is suggested for computing a generalized inverse of a matrix. Initially suitable diagonal corrections are introduced in (the symmetrized form of) the given matrix to facilitate decomposition; a backward-correction scheme then yields a desired generalized inverse.

A conditional random field-based downscaling method for assessment of climate change impact on multisite daily precipitation in the Mahanadi basin

Downscaling to station-scale hydrologic variables from large-scale atmospheric variables simulated by general circulation models (GCMs) is usually necessary to assess the hydrologic impact of climate change. This work presents CRF-downscaling, a new probabilistic downscaling method that represents the daily precipitation sequence as a conditional random field (CRF). The conditional distribution of the precipitation sequence at a site, given the daily atmospheric (large-scale) variable sequence, is modeled as a linear chain CRF. CRFs do not make assumptions on independence of observations, which gives them flexibility in using high-dimensional feature vectors. Maximum likelihood parameter estimation for the model is performed using limited memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) optimization. Maximum a posteriori estimation is used to determine the most likely precipitation sequence for a given set of atmospheric input variables using the Viterbi algorithm. Direct classification of dry/wet days as well as precipitation amount is achieved within a single modeling framework. The model is used to project the future cumulative distribution function of precipitation. Uncertainty in precipitation prediction is addressed through a modified Viterbi algorithm that predicts the n most likely sequences. The model is applied for downscaling monsoon (June-September) daily precipitation at eight sites in the Mahanadi basin in Orissa, India, using the MIROC3.2 medium-resolution GCM. The predicted distributions at all sites show an increase in the number of wet days, and also an increase in wet day precipitation amounts. A comparison of current and future predicted probability density functions for daily precipitation shows a change in shape of the density function with decreasing probability of lower precipitation and increasing probability of higher precipitation.

trans gene regulation in adaptive evolution: A genetic algorithm model

This is a continuation of earlier studies on the evolution of infinite populations of haploid genotypes within a genetic algorithm framework. We had previously explored the evolutionary consequences of the existence of indeterminate—“plastic”—loci, where a plastic locus had a finite probability in each generation of functioning (being switched “on”) or not functioning (being switched “off”). The relative probabilities of the two outcomes were assigned on a stochastic basis. The present paper examines what happens when the transition probabilities are biased by the presence of regulatory genes. We find that under certain conditions regulatory genes can improve the adaptation of the population and speed up the rate of evolution (on occasion at the cost of lowering the degree of adaptation). Also, the existence of regulatory loci potentiates selection in favour of plasticity. There is a synergistic effect of regulatory genes on plastic alleles: the frequency of such alleles increases when regulatory loci are present. Thus, phenotypic selection alone can be a potentiating factor in a favour of better adaptation.

Light- and cytokinin-induced changes in the levels of leucine and tyrosine isoaccepting tRNA species and modified nucleotide contents of total tRNA in cucumber seedlings

We have determined relative levels of chloroplast leucine and tyrosine isoaccepting tRNAs and modified nucleotide contents from total tRNAs isolated from dark-grown, light-grown, N6-isopentenyladenine (i6A)-treated dark-grown and i6A-treated light-grown cucumber seedlings. Significant increases in the relative amounts of tRNA(Leu)2 and tRNA(Leu)3 were observed in the i6A-treated dark-grown seedlings compared to dark-grown, light-grown and i6A-treated light-grown seedlings. On the other hand, i6A-treated light-grown seedlings tRNA(Tyr)1 increased to 85% of total tRNAs(Tyr) from about 9% in light-grown seedlings and tRNA(Tyr)2 decreased to 15% compared with 91% in light-grown seedlings. Analysis of modified nucleotide of total tRNAs indicated that pT, pI, pm1A, pm5C, pGm, pm1G, pm2G and pm7G contents were significantly higher in the total tRNA of i6A-treated dark-grown seedlings than those from untreated dark-grown seedlings. Illumination of 8-day-old dark-grown seedlings for 12 h increased the contents of pT, pI, pGm and pm1G when compared to 8-day-old dark-grown seedlings with extended growth for 12 h in dark. On the contrary, i6A had no stimulatory effect in the contents of modified nucleotide in the light-grown seedlings.

A robust initialization scheme for faster convergence of the dichotomous search algorithm for single frequency estimation

The estimation of the frequency of a sinusoidal signal is a well researched problem. In this work we propose an initialization scheme to the popular dichotomous search of the periodogram peak algorithm(DSPA) that is used to estimate the frequency of a sinusoid in white gaussian noise. Our initialization is computationally low cost and gives the same performance as the DSPA, while reducing the number of iterations needed for the fine search stage. We show that our algorithm remains stable as we reduce the number of iterations in the fine search stage. We also compare the performance of our modification to a previous modification of the DSPA and show that we enhance the performance of the algorithm with our initialization technique.

On Sharma-Swarup algorithm for time minimising transportation problems

In this note, the fallacy in the method given by Sharma and Swarup, in their paper on time minimising transportation problem, to determine the setS hkof all nonbasic cells which when introduced into the basis, either would eliminate a given basic cell (h, k) from the basis or reduce the amountx hkis pointed out.

Modified Proportional V-Notch Weirs

Seven different shaped modified proportional V-notches were designed and pertinent data for their use are given in tables 1 - 4. It is shown that the indication accuracies of these weirs are more than that of the conventional V-notch. For five of the designed weirs the indication accuracies are more than that of the conventional rectangular weir at lower heads of flow. All these proportional weirs, except the parabolic based weir, have added advantages over the V-notch in regard to fixing and finding the crest level. Experiments with five weirs (four symmetrical and one unsymmetrical) having rectangular bases and one (symmetrical) with a parabolic base show very good agreement with the theory and give consistent values for the coefficient of discharge, Cd, varying between 0.588 and 0.605, within the ranges of the experiments.

An algorithm to find similar internal sequence repeats

In recent years, identification of sequence patterns has been given immense importance to understand better their significance with respect to genomic organization and evolutionary processes. To this end, an algorithm has been derived to identify all similar sequence repeats present in a protein sequence. The proposed algorithm is useful to correlate the three-dimensional structure of various similar sequence repeats available in the Protein Data Bank against the same sequence repeats present in other databases like SWISS-PROT, PIR and Genome databases.

The Consequences of Phenotypic Plasticity in Cyclically Varying Environments: A Genetic Algorithm Study

By “phenotypic plasticity” we refer to the capacity of a genotype to exhibit different phenotypes, whether in the same or in different environments. We have previously demonstrated that phenotypic plasticity can improve the degree of adaptation achieved via natural selection (Behera & Nanjundiah, 1995). That result was obtained from a genetic algorithm model of haploid genotypes (idealized as one-dimensional strings of genes) evolving in a fixed environment. Here, the dynamics of evolution is examined under conditions of a cyclically varying environment. We find that the rate of evolution, as well as the extent of adaptation (as measured by mean population fitness) is lowered because of environmental cycling. The decrease is adaptation caused by a varying environment can, however, be partly or wholly compensated by an increase in the degree of plasticity that a genotype is capable of. Also, the reduction of population fitness caused by a variable environment can be partially offset by decreasing the total number of genetic loci. We conjecture that an increase in genome size may have been among the factors responsible for the evolution of phenotypic plasticity.

Singular value decomposition based computationally efficient algorithm for rapid dynamic near-infrared diffuse optical tomography

Purpose: A computationally efficient algorithm (linear iterative type) based on singular value decomposition (SVD) of the Jacobian has been developed that can be used in rapid dynamic near-infrared (NIR) diffuse optical tomography. Methods: Numerical and experimental studies have been conducted to prove the computational efficacy of this SVD-based algorithm over conventional optical image reconstruction algorithms. Results: These studies indicate that the performance of linear iterative algorithms in terms of contrast recovery (quantitation of optical images) is better compared to nonlinear iterative (conventional) algorithms, provided the initial guess is close to the actual solution. The nonlinear algorithms can provide better quality images compared to the linear iterative type algorithms. Moreover, the analytical and numerical equivalence of the SVD-based algorithm to linear iterative algorithms was also established as a part of this work. It is also demonstrated that the SVD-based image reconstruction typically requires O(NN2) operations per iteration, as contrasted with linear and nonlinear iterative methods that, respectively, requir O(NN3) and O(NN6) operations, with ``NN'' being the number of unknown parameters in the optical image reconstruction procedure. Conclusions: This SVD-based computationally efficient algorithm can make the integration of image reconstruction procedure with the data acquisition feasible, in turn making the rapid dynamic NIR tomography viable in the clinic to continuously monitor hemodynamic changes in the tissue pathophysiology.

Tendency to promote ferroelectric distortion in Pr-modified PbTiO3

Structural, microstructural, and dielectric studies have been carried out on Pr-modified PbTiO3. A comparative analysis with La-modified PbTiO3 suggests that for chemical modification by same amount, the Pr-modified system has larger tetragonal strain and Curie point. No clear feature of relaxor ferroelectric state is observed for Pr concentration as high as x=0.35, suggesting that Pr modification is less effective, as compared to La-modification, in inducing a relaxor ferroelectric state. Results suggest that inspite of increased chemical disorder, Pr modification partly tends to restore the ferroelectric distortion of the lattice through partial occupancy of the Pr4+ ions on the Ti4+ sites.

A real-time algorithm for simulation of flexible objects and hyper-redundant manipulators

Flexible objects such as a rope or snake move in a way such that their axial length remains almost constant. To simulate the motion of such an object, one strategy is to discretize the object into large number of small rigid links connected by joints. However, the resulting discretised system is highly redundant and the joint rotations for a desired Cartesian motion of any point on the object cannot be solved uniquely. In this paper, we revisit an algorithm, based on the classical tractrix curve, to resolve the redundancy in such hyper-redundant systems. For a desired motion of the `head' of a link, the `tail' is moved along a tractrix, and recursively all links of the discretised objects are moved along different tractrix curves. The algorithm is illustrated by simulations of a moving snake, tying of knots with a rope and a solution of the inverse kinematics of a planar hyper-redundant manipulator. The simulations show that the tractrix based algorithm leads to a more `natural' motion since the motion is distributed uniformly along the entire object with the displacements diminishing from the `head' to the `tail'.

Two-level k-means clustering algorithm for k-tau relationship establishment and linear-time classification

Partitional clustering algorithms, which partition the dataset into a pre-defined number of clusters, can be broadly classified into two types: algorithms which explicitly take the number of clusters as input and algorithms that take the expected size of a cluster as input. In this paper, we propose a variant of the k-means algorithm and prove that it is more efficient than standard k-means algorithms. An important contribution of this paper is the establishment of a relation between the number of clusters and the size of the clusters in a dataset through the analysis of our algorithm. We also demonstrate that the integration of this algorithm as a pre-processing step in classification algorithms reduces their running-time complexity.

Differences in the levels of aminoacylation and contents of modified nucleotides between total tRNAs from N2- and NH4+-grown Azospirillum lipoferum cells

Total tRNAs isolated from N2- and NH4(+)-grown Azospirillum lipoferum cells were compared with respect to amino acid acceptance, isoacceptor tRNA species levels and extent of nucleotide modifications. Amino-acylation of these two tRNA preparations with ten different amino acids indicated differences in the relative acceptor activities. Comparison of aminoacyl-tRNA patterns by RPC-5 column chromatography revealed no qualitative differences in the elution profiles. However, quantitative differences in the relative amounts of some isoacceptors were observed. These results indicate that alterations of relative amounts of functional tRNA species occur to match cellular requirements of the bacterial cells using N2 or NH4+ as nitrogen source. In addition, the content of modified nucleotides in total tRNAs of N2- and NH4(+)-grown cells was determined. In the NH4(+)-grown cells, content of most of the modified nucleotides decreased significantly. Based upon these results, the relationship of chargeability of tRNAs to base modifications is discussed.

Convergence analysis of the Newton algorithm and a pseudo-time marching scheme for diffuse correlation tomography

We propose a self-regularized pseudo-time marching scheme to solve the ill-posed, nonlinear inverse problem associated with diffuse propagation of coherent light in a tissuelike object. In particular, in the context of diffuse correlation tomography (DCT), we consider the recovery of mechanical property distributions from partial and noisy boundary measurements of light intensity autocorrelation. We prove the existence of a minimizer for the Newton algorithm after establishing the existence of weak solutions for the forward equation of light amplitude autocorrelation and its Frechet derivative and adjoint. The asymptotic stability of the solution of the ordinary differential equation obtained through the introduction of the pseudo-time is also analyzed. We show that the asymptotic solution obtained through the pseudo-time marching converges to that optimal solution provided the Hessian of the forward equation is positive definite in the neighborhood of optimal solution. The superior noise tolerance and regularization-insensitive nature of pseudo-dynamic strategy are proved through numerical simulations in the context of both DCT and diffuse optical tomography. (C) 2010 Optical Society of America.