Conformations, vibrational frequencies and Raman intensities of short-chain fatty acid methyl esters using DFT with 6-31G(d) and Sadlej pVTZ basis sets

Density functional calculations, using B3LPY/6-31G(d) methods, have been used to investigate the conformations and vibrational (Raman) spectra of three short-chain fatty acid methyl esters (FAMEs) with the formula CnH2nO2 (n = 3-5). In all three FAMEs, the lowest energy conformer has a simple 'all-trans' structure but there are other conformers, with different torsions about the backbone, which lie reasonably close in energy to the global minimum. One result of this is that the solid samples we studied do not appear to consist entirely of the lowest energy conformer. Indeed, to account for the 'extra' bands that were observed in the Raman data but were not predicted for the all-trans conformer, it was necessary to add-in contributions from other conformers before a complete set of vibrational assignments could be made. Provided this was done, the agreement between experimental Raman frequencies and 6-31G(d) values (after scaling) was excellent, RSD = 12.6 cm(-1). However, the agreement between predicted and observed intensities was much less satisfactory. To confirm the validity of the approach followed by the 6-3 1 G(d) basis set, we used a larger basis set, Sadlej pVTZ, and found that these calculations gave accurate Raman intensities and simulated spectra (summed from two different conformers) that were in quantitative agreement with experiment. In addition, the unscaled Sadlej pVTZ, and the scaled 6-3 1 G(d) calculations gave the same vibrational mode assignments for all bands in the experimental data. This work provides the foundation for calculations on longer-chain FAMEs (which are closer to those found as triglycerides in edible fats and oils) because it shows that scaled 6-3 1 G(d) calculations give equally accurate frequency predictions, and the same vibrational mode assignments, as the much more CPU-expensive Sadlej pVTZ basis set calculations.

Three constructive examples of separable pre-Hilbert spaces nonisomorphic to their closed hyperplanes

An example of a sigma -compact infinite-dimensional pre-Hilbert space H is constructed such that any continuous linear operator T: H --> H is of the form T = lambdaI + F for some lambda is an element of R and for a finite-dimensional continuous linear operator F. A class of simple examples of pre-Hilbert spaces nonisomorphic to their closed hyperplanes is given. A sigma -compact pre-Hilbert space H isomorphic to H x R x R and nonisomorphic to H x R is also constructed.

On effective linearly ordered sets of comparison functions

Both the existence and the non-existence of a linearly ordered (by certain natural order relations) effective set of comparison functions (=dense comparison classes) are compatible with the ZFC axioms of set theory.

An infinite-dimensional separable pre-Hilbert space non-homeomorphic to any of its closed hyperplanes

An example is constructed of an infinite-dimensional separable pre-Hilbert space non-homeomorphic to any of its closed hyperplanes.

Support vector machine classification for large data sets via minimum enclosing ball clustering

Support vector machine (SVM) is a powerful technique for data classification. Despite of its good theoretic foundations and high classification accuracy, normal SVM is not suitable for classification of large data sets, because the training complexity of SVM is highly dependent on the size of data set. This paper presents a novel SVM classification approach for large data sets by using minimum enclosing ball clustering. After the training data are partitioned by the proposed clustering method, the centers of the clusters are used for the first time SVM classification. Then we use the clusters whose centers are support vectors or those clusters which have different classes to perform the second time SVM classification. In this stage most data are removed. Several experimental results show that the approach proposed in this paper has good classification accuracy compared with classic SVM while the training is significantly faster than several other SVM classifiers.