Lennard-Jones-Devonshire equation of state is an old but theoretical based EOS. The concept of the nearest neighboring molecules or coordination number is proposed to be a function of temperature and volume, whereas it is a constant in the original. The dilute gas and hard sphere limits of molecules are employed to determine this function. Improvement of this modification is demonstrated by pro...

the structure of n,n'-bis(2-hydroxybenzylidene)-2,2-dimethyl-1,3-propanediamine, c19h22n2o2, has been studied at low temperature (120k) by means of single-crystal x-ray diffraction. solving the structure shows an orthorhombic unit cell, with p212121 space group, z = 4, a = 6.1046 (4) å, b = 15.8349 (11)å, c = 17.2898 (12) å and v = 1671.3 (2) å3. there are two relatively strong hydrogen bonds (...

Recently, several quantum computation schemes utilizing ultracold dipolar molecules trapped in optical lattices were suggested [1]. The coupling due to dipole-dipole interactions between molecular bits is strong enough to induce entanglement and hence to realize a set of universal quantum logic gates. However, the electric dipole-dipole interaction between molecules can not be controllably swit...

Recently, state-of-the-art classification performance of natural images has been obtained by self-supervised learning (S2L) as it can generate latent features through between different views the same images. However, semantic information similar hardly exploited these S2L-based methods. Consequently, to explore potential S2L samples in hyperspectral image (HSIC), we propose nearest neighboring ...

Finding nearest neighbors in large multi-dimensional data has always been one of the research interests in data mining field. In this paper, we present our continuous research on similarity search problems. Previously we have worked on exploring the meaning of K nearest neighbors from a new perspective in PanKNN [20]. It redefines the distances between data points and a given query point Q, eff...

Cooperation in cellular networks is a promising scheme to improve system performance. Existing works consider that a user dynamically chooses the stations that cooperate for his/her service, but such assumption often has practical limitations. Instead, cooperation groups can be predefined and static, with nodes linked by fixed infrastructure. To analyze such a potential network, we propose a gr...

MOTIVATION High-throughput methods are beginning to make possible the genotyping of thousands of loci in thousands of individuals, which could be useful for tightly associating phenotypes to candidate loci. Current mapping algorithms cannot handle so many data without building hierarchies of framework maps. RESULTS A version of Kruskal's minimum spanning tree algorithm can solve any genetic m...