Effects of Δtor1 on Yeast Longevity via Chronological Lifespan Assay

TOR1 is known to extend chronological lifespan in S. cerevisiae. Δtor1 deletion was studied via chronological lifespan assay and environmental oxidative stress test. This deletion was confirmed via growth in selective media and through deletion check primers. The Δtor1 deletion created demonstrated similar growth and cellular response to environmental oxidative stress as previously put forth by Bonawitz et al. and Pan et al. In this work, partial inhibition of TOR by deletion of TOR1 is studied through S. cerevisiae longevity via a chronological lifespan assay, with intention of studying the double gene deletion strains of Δlys7/Δtor1, Δsod1/Δtor1, Δsod2/Δtor1, and Δctr1/Δtor1. Double gene deletion strains of Δlys7/Δtor1, Δsod1/Δtor1, Δsod2/Δtor1, and Δctr1/Δtor1 are not well-characterized for their effects on S. cerevisiae longevity

Stitching IC Images

Image stitching software is used in many areas such as photogrammetry, biomedical imaging, and even amateur digital photography. However, these algorithms require relatively large image overlap, and for this reason they cannot be used to stitch the integrated circuit (IC) images, whose overlap is typically less than 60 pixels for a 4096 by 4096 pixel image. In this paper, we begin by using algorithmic graph theory to study optimal patterns for adding IC images one at a time to a grid. In the remaining sections we study ways of stitching all the images simultaneously using different optimisation approaches: least squares methods, simulated annealing, and nonlinear programming

Analysis of a parallelized nonlinear elliptic boundary value problem solver with application to reacting flows

A parallelized finite difference code based on the Newton method for systems of nonlinear elliptic boundary value problems in two dimensions is analyzed in terms of computational complexity and parallel efficiency. An approximate cost function depending on 15 dimensionless parameters is derived for algorithms based on stripwise and boxwise decompositions of the domain and a one-to-one assignment of the strip or box subdomains to processors. The sensitivity of the cost functions to the parameters is explored in regions of parameter space corresponding to model small-order systems with inexpensive function evaluations and also a coupled system of nineteen equations with very expensive function evaluations. The algorithm was implemented on the Intel Hypercube, and some experimental results for the model problems with stripwise decompositions are presented and compared with the theory. In the context of computational combustion problems, multiprocessors of either message-passing or shared-memory type may be employed with stripwise decompositions to realize speedup of O(n), where n is mesh resolution in one direction, for reasonable n

Combining finite element and finite difference methods for isotropic elastic wave simulations in an energy-conserving manner

We consider numerical simulation of the isotropic elastic wave equations arising from seismic applications with non-trivial land topography. The more flexible finite element method is applied to the shallow region of the simulation domain to account for the topography, and combined with the more efficient finite difference method that is applied to the deep region of the simulation domain. We demonstrate that these two discretization methods, albeit starting from different formulations of the elastic wave equation, can be joined together smoothly via weakly imposed interface conditions. Discrete energy analysis is employed to derive the proper interface treatment, leading to an overall discretization that is energy-conserving. Numerical examples are presented to demonstrate the efficacy of the proposed interface treatment