In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
This article describes a survey which aims to identify the relative importance of a set of factors that affect the motivation of software engineers at work. The conceptual underpi...
“Don’t put all your eggs in one basket” is common wisdom with respect to financial portfolio theory. The configuration of customer portfolios with regard to appropriate risk...
This paper develops a classification algorithm in the framework of spectral graph theory where the underlying manifold of a high dimensional data set is described by a graph. The...
— This paper aims to present ideas to bridge the gap between two conflicting views of information: Shannon information, which is used to model physical layer information, and se...