In this paper, we propose a cluster-adjacency based method to order sentences for multi-document summarization tasks. Given a group of sentences to be organized into a summary, each sentence was mapped to a theme in source documents by a semi-supervised classification method, and adjacency of pairs of sentences is learned from source documents based on adjacency of clusters they belong to. Then...

Most of the analyses on the conservation of gene order are limited to orthologous genes. However, the organization of genes into operons might also result in the conservation of gene order of paralogous genes. Thus, we sought computational evidence that conservation of gene order of paralogous genes represents another level of conservation of genes in operons. We found that pairs of genes withi...

The intrinsic volumes – in 3d up to constants volume, surface area, integral of mean curvature, and Euler number – are a very useful set of geometric characteristics. Combining integral and digital geometry we develop a method for efficient simultanous calculation of the intrinsic volumes of sets observed in binary images. In order to achieve consistency in the derived intrinsic volumes for bot...

A new generalization of Fiedler's lemma is obtained by introducing the concept main function a matrix. As applications, universal spectra H-join any graphs (possibly non-regular) and adjacency H-generalized join constrained (arbitrary) vertex subsets are obtained. The generalized corona deduced from graphs. Also, construction infinitely many pairs non-regular cospectral provided.

Abstract Graph products have been extensively applied to model complex networks with striking properties observed in real-world systems. In this paper, we study the hitting times for random walks on a class of graphs generated iteratively by edge corona product. We first derive recursive solutions eigenvalues and eigenvectors normalized adjacency matrix associated graphs. Based these results, f...

We discuss the design and preliminary results of an experiment for modeling human-human multi-threaded dialogues. We found that participants tend to complete adjacency pairs in dialogues before switching to a new dialogue thread. We also have indications that, in the presence of a manualvisual task, the difficulty of the task influences switching between dialogue threads.