Learn More
The problem of finding the best strategy to immunize a population or a computer network with a minimal number of immunization doses is of current interest. It has been accepted that the targeted strategies on most central nodes are most efficient for model and real networks. We present a newly developed graph-partitioning strategy which requires 5% to 50%(More)
We apply percolation theory to a recently proposed measure of fragmentation F for social networks. The measure F is defined as the ratio between the number of pairs of nodes that are not connected in the fragmented network after removing a fraction q of nodes and the total number of pairs in the original fully connected network. We compare F with the(More)
Kernel density smoothing techniques have been used in classification or supervised learning of gene expression profile (GEP) data, but their applications to clustering or unsupervised learning of those data have not been explored and assessed. Here we report a kernel density clustering method for analysing GEP data and compare its performance with the three(More)
HTTP/2 is the next generation of the HTTP protocol, and as such, it is supposed to solve past issues and to bring improved performances. Through thorough experiments, we try to bring reliable figures on this new version of the protocol. To do this, we adopt a methodological approach, taking newly introduced features into consideration: compression,(More)
We review results on the scaling of the optimal path length opt in random networks with weighted links or nodes. We refer to such networks as " weighted " or " disordered " networks. The optimal path is the path with minimum sum of the weights. In strong disorder, where the maximal weight along the path dominates the sum, we find that opt increases(More)
We study the statistics of the optimal path in both random and scale-free networks, where weights are taken from a general distribution P(w). We find that different types of disorder lead to the same universal behavior. Specifically, we find that a single parameter (S defined as AL(-1/v) for d-dimensional lattices, and S defined as AN(-1/3) for random(More)
OBJECTIVES Personality disorder functioning styles might contribute to the inconclusive findings about alexithymic features in schizophrenia. We therefore studied the relationship between alexithymia and personality styles in paranoid schizophrenia. METHODS We administered the Chinese versions of the Toronto Alexithymia Scale (TAS-20), the Parker(More)
Content Aware Networks define architectures capable of providing network, server context and user context-awareness to the selection of the appropriate content server, from which the Multimedia stream will be transmitted. The number and nature of the parameters involved in content server selection require enhanced multi-criteria decision algorithms in order(More)