We propose to score phrase translation pairs for statistical machine translation using term weight based models. These models employ tf.idf to encode the weights of content and non-content words in phrase translation pairs. The translation probability is then modeled by similarity functions defined in a vector space. Two similarity functions are compared. Using these models in a statistical mac...

We developed a new approach for pairwise kinship analysis in forensic genetics based on chromosomal sharing between two individuals. Here, we defined "index of chromosome sharing" (ICS) calculated using 174,254 single nucleotide polymorphism (SNP) loci typed by SNP microarray and genetic length of the shared segments from the genotypes of two individuals. To investigate the expected ICS distrib...

Proof Idea For any two specific inputs there exists an algorithm that is adapted to these inputs. For example, if we take the two inputs x = (1, 2, ..., n) as a “yes” example, and y = (1, 1, 2, 2, ..., n, n, n + 1, n + 2, ..., n(1 − )) as a “no” example, then an algorithm that checks the second coordinate can distinguish between them. Therefore, we look on distributions over inputs. We need two...

We consider undirected graphs, and assume that each edge of G exists with probability p 2 (0; 1). The all{terminal reliability function A(G; p) of such a random graph G is the probability that the spanning subgraph formed by the existing edges is connected. A two{graph is a graph with two distinguished vertices called terminals. The two{terminal reliability function T (G; p) of a two{graph G is...

Under the Endangered Species Act, documenting recovery and federally mandated population levels of wolves (Canis lupus) in the Northern Rocky Mountains (NRM) requires monitoring wolf packs that successfully recruit young. United States Fish and Wildlife Service regulations define successful breeding pairs as packs estimated to contain an adult male and female, accompanied by 2 pups on 31 Decemb...

We study both upper and lower bounds on the average-case complexity of shortestpaths algorithms. It is proved that the all-pairs shortest-paths problem on n-vertex networks can be solved in time O(n2 logn) with high probability with respect to various probability distributions on the set of inputs. Our results include the first theoretical analysis of the average behavior of shortest-paths algo...

For a model one-dimensional asymmetric double-well potential we calculated the so-called survival probability (i.e., the probability for a particle initially localized in one well to remain there). We use a semiclassical (WKB) solution of the Schrödinger equation. It is shown that behavior essentially depends on transition probability, and on a dimensionless parameter Lambda that is a ratio of ...

We construct a non-locality game that can be won with certainty by a quantum strategy using logn shared EPR-pairs, while any classical strategy has winning probability at most 1 2 +O (

Monozygotic (MZ) twins form an important system for the study of biological plasticity in humans. While MZ twins are generally considered to be genetically identical, a number of studies have emerged that have demonstrated copy-number differences within a twin pair, particularly in those discordant for disease. The rate of autosomal copy-number variation (CNV) discordance within MZ twin pairs w...

In this paper, we discovered that RC4 can generate colliding key pairs with various hamming distances, other than those found by Matsui (with hamming distance one), and by Chen and Miyaji (with hamming distance three). We formalized RC4 colliding key pairs into two large patterns, namely, Transitional pattern and Self-Absorbing pattern, according to the behavior during KSA. The colliding key pa...