Gas chromatography/mass spectrometry of polychlorinated biphenyls using atmospheric pressure chemical ionization and atmospheric pressure photoionization microchips

Gas chromatography (GC) and ion trap mass spectrometry (MS) were combined with microchip atmospheric pressure chemical ionization (microAPCI) and microchip atmospheric pressure photoionization (microAPPI) sources. Selected polychlorinated biphenyls (PCBs, IUPAC Nos. 28, 52, 101, 118, 138, 153 and 180) were analyzed by GC/microAPCI-MS and GC/microAPPI-MS to demonstrate the applicability of the miniaturized ion sources in negative ion mode analysis. The microAPCI and microAPPI methods were evaluated in respect of detection limit, linearity and repeatability. The detection limits for the PCB congeners were somewhat lower with microAPCI than with microAPPI, whereas microAPPI showed slightly wider linear range and better repeatability. With both methods, the best results were obtained for highly chlorinated or non-ortho-chlorinated PCBs, which possess the highest electron affinities. Finally, the suitability of the GC/microAPPI-MS method for the analysis of PCBs in environmental samples was demonstrated by analyzing soil extracts, and by comparing the results with those obtained by gas chromatography with electron capture detection (GC/ECD).     

Nonadiabatic Ehrenfest molecular dynamics within the projector augmented-wave method

We derive equations for nonadiabatic Ehrenfest molecular dynamics within the projector augmented-wave (PAW) formalism. The discretization of the electrons is time-dependent as the augmentation functions depend on the positions of the nuclei. We describe the implementation of the Ehrenfest molecular dynamics equations within the real-space PAW method. We demonstrate the applicability of our method by studying the vibration of NaCl, the torsional rotation of H(2)C=NH(2)(+) in both the adiabatic and the nonadiabatic regimes, and the hydrogen bombardment of C(40)H(16).     

Optimal Identifying Codes in Cycles and Paths

The concept of identifying codes in a graph was introduced by Karpovsky et?al. (in IEEE Trans Inf Theory 44(2):599–611, 1998). These codes have been studied in several types of graphs such as hypercubes, trees, the square grid, the triangular grid, cycles and paths. In this paper, we determine the optimal cardinalities of identifying codes in cycles and paths in the remaining open cases.