A protein sequence-structure alignment method for database searches is examined on how effectively this method together with a simple scoring function previously developed can identify compatibilities between sequences and structures of proteins. The scoring function consists of pairwise contact energies, repulsive packing potentials of residues for overly dense arrangement and short-range pote...

We review how to solve the all-pairs shortest-path problem in a nonnegatively Ž 2 . weighted digraph with n vertices in expected time O n log n . This bound is shown to hold with high probability for a wide class of probability distributions on nonnegatively weighted Ž . digraphs. We also prove that, for a large class of probability distributions, V n log n time is necessary with high probabili...

We investigate the prevalence of Li-Yorke pairs for C and C multimodal maps f with non-flat critical points. We show that every measurable scrambled set has zero Lebesgue measure and that all strongly wandering sets have zero Lebesgue measure, as does the set of pairs of asymptotic (but not asymptotically periodic) points. If f is topologically mixing and has no Cantor attractor, then typical (...

We present an all-pairs shortest path algorithm whose running time on a complete directed graph on n vertices whose edge weights are chosen independently and uniformly at random from [0, 1] is O(n), in expectation and with high probability. This resolves a long standing open problem. The algorithm is a variant of the dynamic all-pairs shortest paths algorithm of Demetrescu and Italiano. The ana...

It is pointed out that there are now known four very close pairs of QSOs with separations < 5 arcsec and very different redshifts. Several estimates of the probability that they are accidental configurations range between 10 −7 and 3.5×10 −3. We conclude either that this is further evidence that QSOs have significant non-cosmological redshift components, or that the pairs must be explained by g...

In this paper, the concept of the classical f -divergence for a pair of measures is extended to the mixed f -divergence for multiple pairs of measures. The mixed f -divergence provides a way to measure the difference between multiple pairs of (probability) measures. Properties for the mixed f -divergence are established, such as permutation invariance and symmetry in distributions. An Alexandro...

The EM algorithm can be used to estimate conditional probabilities for matching field patterns for the Fellegi-Sunter model for record linkage. The algorithm is based on a latent class model for the record pairs where one of the classes is the set of true matches. If the number of true match pairs in the data set is too small, then the EM algorithm cannot detect the correct latent class. We con...

Traditionally, research into circuit-switched (C-S) networks has been divided into two areas, reliability and performance, each making little reference to the other. More recently, however, research has focused on unification of the two. One possible choice for a combined performance and reliability measure is the overall network grade-of-service (NGOS), i.e. the overall probability of blocking...

We present an all-pairs shortest path algorithm whose running time on a complete directed graph on n vertices whose edge weights are chosen independently and uniformly at random from [0, 1] is O(n2), in expectation and with high probability. This resolves a long-standing open problem. The algorithm is a variant of the dynamic all-pairs shortest paths algorithm of Demetrescu and Italiano [2006]....

To overcome the scarceness of bilingual corpora for some language pairs in machine translation, pivot-based SMT uses pivot language as a "bridge" to generate source-target translation from sourcepivot and pivot-target translation. One of the key issues is to estimate the probabilities for the generated phrase pairs. In this paper, we present a novel approach to calculate the translation probabi...