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

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

Domain decomposition methods for the parallel computation of reacting flows

Domain decomposition is a natural route to parallel computing for partial differential equation solvers. Subdomains of which the original domain of definition is comprised are assigned to independent processors at the price of periodic coordination between processors to compute global parameters and maintain the requisite degree of continuity of the solution at the subdomain interfaces. In the domain-decomposed solution of steady multidimensional systems of PDEs by finite difference methods using a pseudo-transient version of Newton iteration, the only portion of the computation which generally stands in the way of efficient parallelization is the solution of the large, sparse linear systems arising at each Newton step. For some Jacobian matrices drawn from an actual two-dimensional reacting flow problem, comparisons are made between relaxation-based linear solvers and also preconditioned iterative methods of Conjugate Gradient and Chebyshev type, focusing attention on both iteration count and global inner product count. The generalized minimum residual method with block-ILU preconditioning is judged the best serial method among those considered, and parallel numerical experiments on the Encore Multimax demonstrate for it approximately 10-fold speedup on 16 processors