We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with, respectively, nA and nB vertices. We define an nB ×nA similarity matrix S whose real entry sij expresses how similar vertex j (in GA) is to vertex i (in GB): we say that sij is their similarity score. The similarity matrix can be obtained as the limit of the normalized even itera...

Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nB × nA similarity matrix S whose real entry sij expresses how similar vertex j (in GA) is to vertex i (in GB) : we say that sij is their similarity score. The similarity matrix can be obtained as the limit of the normalized e...

| A number of recent empirical studies of traf-c measurements from a variety of working packet networks have convincingly demonstrated that actual network traac is self-similar or long-range dependent in nature (i.e., bursty over a wide range of time scales) { in sharp contrast to commonly made traac modeling assumptions. In this paper, we provide a plausible physical explanation for the occurr...

Questions that require answers in the form of a list of entities and the identification of diverse biological entity classes present an interesting challenge that required new approaches not needed for the TREC 2006 Genomics track. We added some components to our automatic question answering system, including (i) a simple algorithm to select which keywords extracted from natural language questi...

Recommender system has attracted lots of attentions since it helps users alleviate the information overload problem. Matrix factorization technique is one of the most widely employed collaborative filtering techniques in the research of recommender systems due to its effectiveness and efficiency in dealing with very large user-item rating matrices. Recently, based on the intuition that addition...

the study addresses performance control matrix (pcm) to determine service quality items of priority for improvement. most businesses focus on customer satisfaction when undertaking surveys of satisfaction and dissatisfaction, while generally neglecting employee satisfaction. therefore, this study develops an integrated model to improve service quality in taiwanese finance industry employees. a ...

Similarity has become a classical tool for ontology confrontation motivated by alignment, mapping or merging purposes. In the definition of an ontologybased measure one has the choice between covering a single facet (e.g., URIs, labels, instances of an entity, etc.), covering all of the facets or just a subset thereof. In our matching tool, OLA, we had opted for an integrated approach towards s...

estimating similarity is expressed in many domains and sciences. for instance, data mining, web mining, clustering, search engines, ontology mapping and social networks require the definition and deployment of similarity. user similarity in social networks is one of the main problems and has many applications in this area. in this paper, a new method is introduced for combining structural and n...

Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB similarity matrix S whose real entry sij expresses how similar vertex i (in GA) is to vertex j (in GB) : we say that sij is their similarity score. In the special case where GA = GB = G, the score sij is the similarity...

We present a new polynomially solvable case of the Quadratic Assignment Problem in Koopmans-Beckman form QAP(A,B), by showing that the identity permutation is optimal when A and B are respectively a Robinson similarity and dissimilarity matrix and one of A or B is a Toeplitz matrix. A Robinson (dis)similarity matrix is a symmetric matrix whose entries (increase) decrease monotonically along row...