Optimization of trial wave functions for use in quantum Monte Carlo with application to LiH

Methods for both partial and full optimization of wavefunction parameters are explored, and these are applied to the LiH molecule. A partial optimization can be easily performed with little difficulty. But to perform a full optimization we must avoid a wrong minimum, and deal with linear-dependency, time step-dependency and ensemble-dependency problems. Five basis sets are examined. The optimized wavefunction with a 3-function set gives a variational energy of -7.998 + 0.005 a.u., which is comparable to that (-7.990 + 0.003) 1 of Reynold's unoptimized \fin ( a double-~ set of eight functions). The optimized wavefunction with a double~ plus 3dz2 set gives ari energy of -8.052 + 0.003 a.u., which is comparable with the fixed-node energy (-8.059 + 0.004)1 of the \fin. The optimized double-~ function itself gives an energy of -8.049 + 0.002 a.u. Each number above was obtained on a Bourrghs 7900 mainframe computer with 14 -15 hrs CPU time.

The study of ligand binding specificities of the lipid binding proteins : recombinant human a-tocopherol transport protein (a-ttp), supernatant protein factor (spf) and S. cerevisiae Sec 14p for vitamin e (rrr-a-tocopherol) and other hydrophobic ligands.

One of the various functions of proteins in biological systems is the transport of small molecules, for this purpose proteins have naturally evolved special mechanisms to allow both ligand binding and its subsequent release to a target site; a process fundamental to many biological processes. Transport of Vitamin E (a-tocopherol), a lipid soluble antioxidant, to membranes helps in the protection of polyunsaturated fatty acids against peroxidative damage. In this research, the ligand binding characteristics of several members of the CRALTRIO family of lipid binding proteins was examined; the recombinant human a-Tocopherol Transfer Protein (a-TIP), Supernatant Protein Factor (SPF)ffocopherol Associated Protein (TAP), Cellular Retinaldehyde Binding Protein (CRALBP) and the phosphatidylinositol transfer protein from S. cerevisiae Sec 14p. Recombinant Sec 14p was expressed and purified from E. coli for comparison of tocopherol binding to the two other recombinant proteins postulated to traffic a-tocopherol. Competitive binding assays using [3H]-a-tocopherol and Lipidex-l000 resin allowed determination of the dissociation constants ~) of the CRAL-TRIO proteins for a-tocopherol and - 20 hydrophobic ligands for evaluation of the possible biological relevance of the binding interactions observed. The KIs (nM) for RRR-a-tocopherol are: a-TIP: 25.0, Sec 14p: 373, CRALBP: 528 and SPFffAP: 615. This indicates that all proteins recognize tocopherol but not with the same affinity. Sec 14p bound its native ligand PI with a KI of381 whereas SPFffAP bound PI (216) and y-tocopherol (268) similarly in contrast to the preferential binding ofRRR-a-tocopherol by a-TIP. Efforts to adequately represent biologically active SPFff AP involved investigation of tocopherol binding for several different recombinant proteins derived from different constructs and in the presence of different potential modulators (Ca+2, Mg+2, GTP and GDP); none of these conditions enhanced or inhibited a-tocopherol binding to SPF. This work suggests that only aTTP serves as the physiological mediator of a-tocopherol, yet structural homology between proteins allows common recognition of similar ligand features. In addition, several photo-affmity analogs of a-tocopherol were evaluated for their potential utility in further elucidation of a-TTP function or identification of novel tocopherol binding proteins.

Calculation of nondifferential properties for atomic ground states /

A new method for sampling the exact (within the nodal error) ground state distribution and nondiflPerential properties of multielectron systems is developed and applied to firstrow atoms. Calculated properties are the distribution moments and the electronic density at the nucleus (the 6 operator). For this purpose, new simple trial functions are developed and optimized. First, using Hydrogen as a test case, we demonstrate the accuracy of our algorithm and its sensitivity to error in the trial function. Applications to first row atoms are then described. We obtain results which are more satisfactory than the ones obtained previously using Monte Carlo methods, despite the relative crudeness of our trial functions. Also, a comparison is made with results of highly accurate post-Hartree Fock calculations, thereby illuminating the nodal error in our estimates. Taking into account the CPU time spent, our results, particularly for the 8 operator, have a relatively large variance. Several ways of improving the eflSciency together with some extensions of the algorithm are suggested.

Synthesis of 4-hydroxycinnamic amides of di-, tri-, and tetraamines : potential insect toxins /

The monoconjugates of phenolic acids (i.e. coumaric acid) with polyamines such as spermidine and spermine are strikingly similar to some toxins from spiders and predatory wasps. Many plants contain phenolic acid polyamine conjugates and there is some reliable information supporting their roles as plant defense chemicals. Eleven monoacylated compounds of diamines, triamines, tetraamines and oxa-polyamine amines were prepared in three to seven steps: 22, 23, 24, 25, 26, 27, 28, 29, 30, 31 and 32. The synthesis proceeds through stepwise construction of the polyamine backbone (as in 62 and 72), followed by protection and deprotection steps of the amino functions. Desymmetrization of readily available and prepared symmetrical polyamines is a key step in the synthesis. The protecting groups employed were tert-butoxycarbonyl (BOC) and trifluoroacetyl (TFA) group which were removed under different conditions: acid and base respectively. Deprotection and refunctionalization of the polyamine reagent demonstrated the versatility of these systems for N-acylation.

Prime Rational Functions and Integral Polynomials

Let f(x) be a complex rational function. In this work, we study conditions under which f(x) cannot be written as the composition of two rational functions which are not units under the operation of function composition. In this case, we say that f(x) is prime. We give sufficient conditions for complex rational functions to be prime in terms of their degrees and their critical values, and we derive some conditions for the case of complex polynomials. We consider also the divisibility of integral polynomials, and we present a generalization of a theorem of Nieto. We show that if f(x) and g(x) are integral polynomials such that the content of g divides the content of f and g(n) divides f(n) for an integer n whose absolute value is larger than a certain bound, then g(x) divides f(x) in Z[x]. In addition, given an integral polynomial f(x), we provide a method to determine if f is irreducible over Z, and if not, find one of its divisors in Z[x].

Protein subcellular targeting inTrichoderma aggressivum f. aggressivum

Trichoderma aggressivum f. aggressivum is a filamentous soil fungus. Green mold disease of commercial mushrooms caused by this species in North America has resulted in millions of dollars in lost revenue within the mushroom growing industry. Research on the molecular level of T aggressivum have jus t begun with the goal of understanding the functions of each gene and protein, and their expression control. Protein targeting has not been well studied in this species yet. Therefore, the intent of this study was to test the protein localization and production levels in T aggressivum with green fluorescent protein (GFP) with an intron and tagged with either nuclear localization signal (NLS) or an endoplasmic reticulum retention signal (KDEL). Two GFP constructs (with and without the intron) were used as controls in this study. All four constructs were successfully transferred into T aggressivum and all modified strains showed similar growth characteristics as the wild type non-transformed isolate. GFP expression was detected from all modified T aggressivum with confocal microscopy and the expression was similar in all four strains. The intron tested in this study had no or very minor effects as GFP expression was similar with or without it. The GFP signal increased over a 5 day period for all transformants, while the GFP to total protein ratio decreased over the same period for all transformants. The GFP-KDEL transformant showed similar protein expression level and localization as did the control transformant lacking the KDEL retention signal. The GFP-NLS transformant similarly failed to localize GFP into nucleus as fluorescence with this strain was virtually identical to the GFP transformant lacking the NLS. Thus, future research is required to find effective localization signals for T aggressivum.

Improving Short DNA Sequence Alignment with Parallel Computing

Variations in different types of genomes have been found to be responsible for a large degree of physical diversity such as appearance and susceptibility to disease. Identification of genomic variations is difficult and can be facilitated through computational analysis of DNA sequences. Newly available technologies are able to sequence billions of DNA base pairs relatively quickly. These sequences can be used to identify variations within their specific genome but must be mapped to a reference sequence first. In order to align these sequences to a reference sequence, we require mapping algorithms that make use of approximate string matching and string indexing methods. To date, few mapping algorithms have been tailored to handle the massive amounts of output generated by newly available sequencing technologies. In otrder to handle this large amount of data, we modified the popular mapping software BWA to run in parallel using OpenMPI. Parallel BWA matches the efficiency of multithreaded BWA functions while providing efficient parallelism for BWA functions that do not currently support multithreading. Parallel BWA shows significant wall time speedup in comparison to multithreaded BWA on high-performance computing clusters, and will thus facilitate the analysis of genome sequencing data.

GA approach for finding Rough Set decision rules based on bireducts

Feature selection plays an important role in knowledge discovery and data mining nowadays. In traditional rough set theory, feature selection using reduct - the minimal discerning set of attributes - is an important area. Nevertheless, the original definition of a reduct is restrictive, so in one of the previous research it was proposed to take into account not only the horizontal reduction of information by feature selection, but also a vertical reduction considering suitable subsets of the original set of objects. Following the work mentioned above, a new approach to generate bireducts using a multi--objective genetic algorithm was proposed. Although the genetic algorithms were used to calculate reduct in some previous works, we did not find any work where genetic algorithms were adopted to calculate bireducts. Compared to the works done before in this area, the proposed method has less randomness in generating bireducts. The genetic algorithm system estimated a quality of each bireduct by values of two objective functions as evolution progresses, so consequently a set of bireducts with optimized values of these objectives was obtained. Different fitness evaluation methods and genetic operators, such as crossover and mutation, were applied and the prediction accuracies were compared. Five datasets were used to test the proposed method and two datasets were used to perform a comparison study. Statistical analysis using the one-way ANOVA test was performed to determine the significant difference between the results. The experiment showed that the proposed method was able to reduce the number of bireducts necessary in order to receive a good prediction accuracy. Also, the influence of different genetic operators and fitness evaluation strategies on the prediction accuracy was analyzed. It was shown that the prediction accuracies of the proposed method are comparable with the best results in machine learning literature, and some of them outperformed it.