Introductory chemistry textbooks often present valence bond (VB) theory as useful, but incorrect and inferior to molecular orbital (MO) theory, citing the electronic structure of O2 electron delocalization evidence. Even texts that initially two theories on equal footing use language biases students toward MO approach. However, these “failures” VB are really just misconceptions and/or misapplic...

BACKGROUND To select a proper diagnostic test, it is recommended that the most specific test be used to confirm (rule in) a diagnosis, and the most sensitive test be used to establish that a disease is unlikely (rule out). These rule-in and rule-out concepts can also be characterized by the likelihood ratio (LR). However, previous papers discussed only the case of binary tests and assumed test ...

Aligning and comparing two polygonal chains in 3D space is an important problem in many areas of research, like in protein structure alignment. A lot of research has been done in the past on this problem, using RMSD as the distance measure. Recently, the discrete Fréchet distance has been applied to align and simplify protein backbones (geometrically, 3D polygonal chains) by Jiang et al., with ...

It is challenging to find a small set of data points, so-called exemplars or landmarks, that are nicely representative of itself and other data points. Affinity propagation (AP) is an effective algorithm that identifies exemplars among data points by recursively sending realvalued messages between pairs of data points. AP calculates the message using the similarity among data points. Hence, the...

We propose a framework for error robust real−time video telephony over wireless networks. In our approach we cope with packet loss on the downlink by retransmitting lost packets from the base station to the receiver terminal. The effect of lost packets is reduced using error concealment. Retransmitted packets are used for error recovery. In order to be able to use the retransmissions for error ...

We examine categoricity issues for computable algebraic fields. Such fields behave nicely for computable dimension: we show that they cannot have finite computable dimension greater than 1. However, they behave less nicely with regard to relative computable categoricity: we give a structural criterion for relative computable categoricity of these fields, and use it to construct a field that is ...

Most nonlinear dimensionality reduction approaches such as Isomap heavily depend on the neighborhood structure of manifold. They determine the neighborhood graph using Euclidean distance so that they often fail to nicely deal with sparsely sampled or noise contaminated data. This paper applies the graph algebra to optimize the neighborhood structure for Isomap. The improved Isomap outperforms t...

Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model we assume that we have access to one versus all queries that given a point s ∈ S return the distances between s and all other points. We show that given a natural assumption about the structure of the instance, we can ...