Shape resonance spectra of uracil, 5-fluorouracil, and 5-chlorouracil.

We report on the shape resonance spectra of uracil, 5-fluorouracil, and 5-chlorouracil, as obtained from fixed-nuclei elastic scattering calculations performed with the Schwinger multichannel method with pseudopotentials. Our results are in good agreement with the available electron transmission spectroscopy data, and support the existence of three π* resonances in uracil and 5-fluorouracil. As expected, the anion states are more stable in the substituted molecules than in uracil. Since the stabilization is stronger in 5-chlorouracil, the lowest π* resonance in this system becomes a bound anion state. The present results also support the existence of a low-lying σ ∗ CCl shape resonance in 5- chlorouracil. Exploratory calculations performed at selected C–Cl bond lengths suggest that the σ ∗ CCl resonance could couple to the two lowest π* states, giving rise to a very rich dissociation dynamics. These facts would be compatible with the complex branching of the dissociative electron attachment cross sections, even though we cannot discuss any details of the vibration dynamics based only on the present fixed-nuclei results.

Parallel Layout Construction Algorithm for Irregular Shape Packing Problems

Cutting and packing problems arise in a variety of industries, including garment, wood and shipbuilding. Irregular shape packing is a special case which admits irregular items and is much more complex due to the geometry of items. In order to ensure that items do not overlap and no item from the layout protrudes from the container, the collision free region concept was adopted. It represents all possible translations for a new item to be inserted into a container with already placed items. To construct a feasible layout, collision free region for each item is determined through a sequence of Boolean operations over polygons. In order to improve the speed of the algorithm, a parallel version of the layout construction was proposed and it was applied to a simulated annealing algorithm used to solve bin packing problems. Tests were performed in order to determine the speed improvement of the parallel version over the serial algorithm