Partitioning objects into closely related groups that have different states allows to understand the underlying structure in the data set treated. Different kinds of similarity measure with clustering algorithms are commonly used to find an optimal clustering or closely akin to original clustering. Using shrinkage-based and rank-based correlation coefficients, which are known to be robust, the ...

Document summarization is a technique aimed to automatically extract the main ideas from electronic documents. With the fast increase of electronic documents available on the network, techniques for making efficient use of such documents become increasingly important. In this paper, we propose a novel algorithm, called TriangleSum for single document summarization based on graph theory. The alg...

Since the late 1960’s, researchers have explored how the structure of the mental lexicon affects spoken word recognition. The proposal that words are recognized relationally in the context of other words in lexical memory has encouraged the use of complex systems to describe connectivity in both the phonological and semantic lexicon. The present study assessed the role of the graph theoretical ...

A community in a large, real-life network, such as the World Wide Web (Web), has been broadly defined as a group of nodes that are densely linked with each other, while being sparsely linked with the rest of the nodes. In the last 2-3 years, community-mining in such networks has emerged as a problem of great practical significance. This problem has been framed in at least two different versions...

This note will extend the research presented in Brown & Rogers (2009) to the case of CRRA agents. We consider the model outlined in that paper in which agents had diverse beliefs about the dividends produced by a risky asset. We now assume that the agents all have CRRA utility, with some integer coefficient of relative risk aversion. This is a generalisation of Brown & Rogers (2009) which consi...

We briefly review and summarize the results in research of China High Technology Networks(CHTN), which can be composed by three levels. A weighted framework is put forward and can be used to study some similar networks. According to our idea and method, the CHTN is constructed. Then the CHTN’s topological properties are investigated, including degree distribution, shortest path length, clusteri...

In this paper we present and simulate a new self–organising algorithm for P2P unstructured networks inspired by human relationships. This algorithm, called PROSA , tries to simulate the evolution of human relationships from simple acquaintance to friendship and partnership. Our target is to obtain a self–reconfiguring P2P system which possesses some of the desirable features of social communiti...

It is well-known that dimX ≤ n if and only if every map of a closed subspace of X into the n-dimensional sphere Sn can be extended over X. It is also well-known that for the cohomological dimension dimGX of X with respect to an abelian coefficient group G, dimGX ≤ n if and only if every map of a closed subspace of X into the Eilenberg-Mac Lane complex K(G,n) extends over X. These properties giv...