Affinity propagation (AP) was recently introduced as an unsupervised learning algorithm for exemplar based clustering. In this paper novel text document clustering algorithm has been developed based on vector space model, phrases and affinity propagation clustering algorithm. Proposed algorithm can be called Phrase affinity clustering (PAC). PAC first finds the phrase by ukkonen suffix tree con...

The evolution and propagation of a partially coherent matter wave (PCMW) is investigated theoretically by the correlation function method. The ABCD matrix formalism previously used for a fully coherent matter wave is extended to the PCMW domain. A new ABCD law is derived, using a tensor method to describe the evolution of a PCMW. An analytical solution of the first-order correlation function is...

Belief propagation on cyclic graphs is an efficient algorithm for computing approximate marginal probability distributions over single nodes and neighboring nodes in the graph. In this paper we propose two new algorithms for approximating joint probabilities of arbitrary pairs of nodes and prove a number of desirable properties that these estimates fulfill. The first algorithm is a propagation ...

Propagation of stochastic electromagnetic beams through paraxial ABCD optical systems operating through turbulent atmosphere is investigated with the help of the ABCD matrices and the generalized Huygens-Fresnel integral. In particular, the analytic formula is derived for the cross-spectral density matrix of an electromagnetic Gaussian Schell-model (EGSM) beam. We applied our analysis for the A...

Lack of memory (locality in time) is a major limitation of almost all present time-dependent density-functional approximations. By using semiclassical dynamics to compute correlation effects in the time propagation of the density matrix, we incorporate memory, including initial-state dependence, as well as changing occupation numbers, and predict more observables in strong-field applications.

Simplified analytic expressions are derived for the optical propagation matrix of magnetic anisotropic Kerr media using the Lagrange–Sylvester interpolation polynomial. This expression is used to investigate magnetic Kerr films in Fabry–Pérot configurations, magneto-optic recording quadrilayers and alternating periodic stacks. It is found that the magneto-optic reflection coefficients are enhan...

The graph isomorphism problem is to determine whether two given graphs are iso-morphic or not. In this paper, we present a new graph invariant, called the probability propagation matrix. By means of this graph invariant, we present a heuristic algorithm for the problem. The algorithm is easy to implement and highly parallelizable.