Recently an increasing amount of research is devoted to the question of how the most influential nodes (seeds) can be found effectively in a complex network. There are a number of measures proposed for this purpose, for instance, high-degree centrality measure reflects the importance of the network topology and has a reasonable runtime performance to find a… (More)
Summary form only given. This talk describes the development of various versions of Raptor codes starting from the first one developed at the end of 2000 to the more advanced versions that are being used in many commercial systems today. We will focus on practical aspects and how these have pushed the theoretical frontiers. The talk will conclude with a… (More)
Let T be a linear opeartor and D be a matrix. So by its diagonal matrix, we get a lot of informations about T , namely we can almost answer any question about T. In this paper we introduce an efficient algorithm that characterizes whether a given matrix is diagonalizable in the field F or not (where F is the real field R or the complex field C).