H2O-CH4 and H2S-CH4 complexes: a direct comparison through molecular beam experiments and ab initio calculations

New molecular beam scattering experiments have been performed to measure the total ( elastic plus inelastic) cross sections as a function of the velocity in collisions between water and hydrogen sulfide projectile molecules and the methane target. Measured data have been exploited to characterize the range and strength of the intermolecular interaction in such systems, which are of relevance as they drive the gas phase molecular dynamics and the clathrate formation. Complementary information has been obtained by rotational spectra, recorded for the hydrogen sulfide-methane complex, with a pulsed nozzle Fourier transform microwave spectrometer. Extensive ab initio calculations have been performed to rationalize all the experimental findings. The combination of experimental and theoretical information has established the ground for the understanding of the nature of the interaction and allows for its basic components to be modelled, including charge transfer, in these weakly bound systems. The intermolecular potential for H2S-CH4 is significantly less anisotropic than for H2O-CH4, although both of them have potential minima that can be characterized as `hydrogen bonded'.

DETERMINISTIC ALGORITHMS FOR MATCHING AND PACKING PROBLEMS BASED ON REPRESENTATIVE SETS

In this work, we study the well-known r-DIMENSIONAL k-MATCHING ((r, k)-DM), and r-SET k-PACKING ((r, k)-SP) problems. Given a universe U := U-1 ... U-r and an r-uniform family F subset of U-1 x ... x U-r, the (r, k)-DM problem asks if F admits a collection of k mutually disjoint sets. Given a universe U and an r-uniform family F subset of 2(U), the (r, k)-SP problem asks if F admits a collection of k mutually disjoint sets. We employ techniques based on dynamic programming and representative families. This leads to a deterministic algorithm with running time O(2.851((r-1)k) .vertical bar F vertical bar. n log(2)n . logW) for the weighted version of (r, k)-DM, where W is the maximum weight in the input, and a deterministic algorithm with running time O(2.851((r-0.5501)k).vertical bar F vertical bar.n log(2) n . logW) for the weighted version of (r, k)-SP. Thus, we significantly improve the previous best known deterministic running times for (r, k)-DM and (r, k)-SP and the previous best known running times for their weighted versions. We rely on structural properties of (r, k)-DM and (r, k)-SP to develop algorithms that are faster than those that can be obtained by a standard use of representative sets. Incorporating the principles of iterative expansion, we obtain a better algorithm for (3, k)-DM, running in time O(2.004(3k).vertical bar F vertical bar . n log(2)n). We believe that this algorithm demonstrates an interesting application of representative families in conjunction with more traditional techniques. Furthermore, we present kernels of size O(e(r)r(k-1)(r) logW) for the weighted versions of (r, k)-DM and (r, k)-SP, improving the previous best known kernels of size O(r!r(k-1)(r) logW) for these problems.