Prediction of electronically nonadiabatic decomposition mechanisms of isolated gas phase nitrogen-rich energetic salt: Guanidium-triazolate

Electronically nonadiabatic decomposition pathways of guanidium triazolate are explored theoretically. Nonadiabatically coupled potential energy surfaces are explored at the complete active space self-consistent field (CASSCF) level of theory. For better estimation of energies complete active space second order perturbation theories (CASPT2 and CASMP2) are also employed. Density functional theory (DFT) with B3LYP functional and MP2 level of theory are used to explore subsequent ground state decomposition pathways. In comparison with all possible stable decomposition products (such as, N-2, NH3, HNC, HCN, NH2CN and CH3NC), only NH3 (with NH2CN) and N-2 are predicted to be energetically most accessible initial decomposition products. Furthermore, different conical intersections between the S-1 and S-0 surfaces, which are computed at the CASSCF(14,10)/6-31G(d) level of theory, are found to play an essential role in the excited state deactivation process of guanidium triazolate. This is the first report on the electronically nonadiabatic decomposition mechanisms of isolated guanidium triazolate salt. (C) 2015 Elsevier B.V. All rights reserved.

FAST AND ACCURATE BILATERAL FILTERING USING GAUSS-POLYNOMIAL DECOMPOSITION

The bilateral filter is a versatile non-linear filter that has found diverse applications in image processing, computer vision, computer graphics, and computational photography. A common form of the filter is the Gaussian bilateral filter in which both the spatial and range kernels are Gaussian. A direct implementation of this filter requires O(sigma(2)) operations per pixel, where sigma is the standard deviation of the spatial Gaussian. In this paper, we propose an accurate approximation algorithm that can cut down the computational complexity to O(1) per pixel for any arbitrary sigma (constant-time implementation). This is based on the observation that the range kernel operates via the translations of a fixed Gaussian over the range space, and that these translated Gaussians can be accurately approximated using the so-called Gauss-polynomials. The overall algorithm emerging from this approximation involves a series of spatial Gaussian filtering, which can be efficiently implemented (in parallel) using separability and recursion. We present some preliminary results to demonstrate that the proposed algorithm compares favorably with some of the existing fast algorithms in terms of speed and accuracy.