OPR

The ability to reproduce a parallel execution is desirable for debugging and program reliability purposes. In debugging (13), the programmer needs to manually step back in time, while for resilience (6) this is automatically performed by the the application upon failure. To be useful, replay has to faithfully reproduce the original execution. For parallel programs the main challenge is inferring and maintaining the order of conflicting operations (data races). Deterministic record and replay (R&R) techniques have been developed for multithreaded shared memory programs (5), as well as distributed memory programs (14). Our main interest is techniques for large scale scientific (3; 4) programming models

Time dependent diffusion in a disordered medium with partially absorbing walls: A perturbative approach

We present an analytical study of the time dependent diffusion coefficient in a dilute suspension of spheres with partially absorbing boundary condition. Following Kirkpatrick (J. Chem. Phys. 76, 4255) we obtain a perturbative expansion for the time dependent particle density using volume fraction $f$ of spheres as an expansion parameter. The exact single particle $t$-operator for partially absorbing boundary condition is used to obtain a closed form time-dependent diffusion coefficient $D(t)$ accurate to first order in the volume fraction $f$. Short and long time limits of $D(t)$ are checked against the known short-time results for partially or fully absorbing boundary conditions and long-time results for reflecting boundary conditions. For fully absorbing boundary condition the long time diffusion coefficient is found to be $D(t)=5 a^2/(12 f D_{0} t) +O((D_0t/a^2)^{-2})$, to the first order of perturbation theory. Here $f$ is small but non-zero, $D_0$ the diffusion coefficient in the absence of spheres, and $a$ the radius of the spheres. The validity of this perturbative result is discussed

Similarity-Based Classification in Partially Labeled Networks

We propose a similarity-based method, using the similarity between nodes, to address the problem of classification in partially labeled networks. The basic assumption is that two nodes are more likely to be categorized into the same class if they are more similar. In this paper, we introduce ten similarity indices, including five local ones and five global ones. Empirical results on the co-purchase network of political books show that the similarity-based method can give high accurate classification even when the labeled nodes are sparse which is one of the difficulties in classification. Furthermore, we find that when the target network has many labeled nodes, the local indices can perform as good as those global indices do, while when the data is sparce the global indices perform better. Besides, the similarity-based method can to some extent overcome the unconsistency problem which is another difficulty in classification.Comment: 13 pages,3 figures,1 tabl

Relations Between Closed String Amplitudes at Higher-order Tree Level and Open String Amplitudes

KLT relations almost factorize closed string amplitudes on $S_2$ by two open string tree amplitudes which correspond to the left- and the right- moving sectors. In this paper, we investigate string amplitudes on $D_2$ and $RP_2$. We find that KLT factorization relations do not hold in these two cases. The relations between closed and open string amplitudes have new forms. On $D_2$ and $RP_2$, the left- and the right- moving sectors are connected into a single sector. Then an amplitude with closed strings on $D_2$ or $RP_2$ can be given by one open string tree amplitude except for a phase factor. The relations depends on the topologies of the world-sheets.Under T-duality, the relations on $D_2$ and $RP_2$ give the amplitudes between closed strings scattering from D-brane and O-plane respectively by open string partial amplitudes.In the low energy limits of these two cases, the factorization relations for graviton amplitudes do not hold. The amplitudes for gravitons must be given by the new relations instead.Comment: 19 page