On the Griffiths numbers for higher dimensional singularities

We show that Yau's conjecture on the inequalities for (n-1)-th Griffiths number and (n-1)-th Hironaka number does not hold for isolated rigid Gorenstein singularities of dimension greater than 2. But his conjecture on the inequality for (n-1)-th Griffiths number is true for irregular singularities.Comment: to appear in Annales de l'Institut Fourie

A differential cluster variation method for analysis of spiniodal decomposition in alloys

A differential cluster variation method (DCVM) is proposed for analysis of spinoidal decomposition in alloys. In this method, lattice symmetry operations in the presence of an infinitesimal composition gradient are utilized to deduce the connection equations for the correlation functions and to reduce the number of independent variables in the cluster variation analysis. Application of the method is made to calculate the gradient energy coefficient in the Cahn-Hilliard free energy function and the fastest growing wavelength for spinodal decomposition in Al-Li alloys. It is shown that the gradient coefficient of congruently ordered Al-Li alloys is much larger than that of the disordered system. In such an alloy system, the calculated fastest growing wavelength is approximately 10 nm, which is an order of magnitude larger than the experimentally observed domain size. This may provide a theoretical explanation why spinodal decomposition after a congruent ordering is dominated by the antiphase boundaries.Comment: 15 pages, 7 figure

L-Shape based Layout Fracturing for E-Beam Lithography

Layout fracturing is a fundamental step in mask data preparation and e-beam lithography (EBL) writing. To increase EBL throughput, recently a new L-shape writing strategy is proposed, which calls for new L-shape fracturing, versus the conventional rectangular fracturing. Meanwhile, during layout fracturing, one must minimize very small/narrow features, also called slivers, due to manufacturability concern. This paper addresses this new research problem of how to perform L-shaped fracturing with sliver minimization. We propose two novel algorithms. The first one, rectangular merging (RM), starts from a set of rectangular fractures and merges them optimally to form L-shape fracturing. The second algorithm, direct L-shape fracturing (DLF), directly and effectively fractures the input layouts into L-shapes with sliver minimization. The experimental results show that our algorithms are very effective