Developing and expanding the universities and increasing the admission of medical students did resolve the physician shortage, but it brought down the educational quality in return. To face this problem, the administrates needed to promote the quality of education which in turn needed accurate up to date information about conditions in different universities. Information about these issues was ...

The purpose of this article is to introduce a new scheme for robust multivariate ranking by making use of a not so familiar notion called monotonicity. Under this scheme, as in the case of classical outward ranking, we get an increasing sequence of regions diverging away from a central region (may be a single point) as nucleus. The nuclear region may be deened as the median region.

We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat that G is also the communication network. The problem is a natural generalization of shortest path lengths to expected path lengths, and represents a model used in many practical applications such as pagerank and eig...

Recently, path flow estimators (PFE) have been used for the estimation of origin–destination (O–D) matrices. This paper develops a formulation that incorporates a decoupled path flow estimator in a generalized least squares (GLS) framework. The approach seeks to solve a GLS problem that minimizes the sum of errors in traffic counts and O–D matrices based on an equilibrium assignment mapping der...

Spectrum sharing in open spectrum systems is a challenging problem, particularly since users experience dynamic spectrum availabilities that vary over time and location. In the absence of any centralize infrastructure, users coordinate their spectrum usage to support fair access of spectrum and avoid interference. One critical challenge is to construct an efficient signalling path in the presen...

In [8] a new data structure called semi-heap is proposed to construct an optimal (n logn) sorting algorithm to sort an intransitive total ordered set, a generalization of regular sorting. In this part, we provide a cost-optimal parallel algorithm using semi-heap. The run time of this algorithm is (n) with (logn) processors under the EREW PRAM model. The use of a Hamiltonian path (generalized so...

We show for every k ≥ 1 that the binomial tree of order 3k has a vertex-coloring with 2k+1 colors such that every path contains some color odd number of times. This disproves a conjecture from [1] asserting that for every tree T the minimal number of colors in a such coloring of T is at least the vertex ranking number of T minus one.

This paper aims to improve probability-based ranking (e.g.AUC) under decision-tree paradigm. We observe the fact that probability-based ranking is to sort samples in terms of their class probabilities. Therefore, ranking is a relative evaluation metric among those samples. This motivates us to use a lazy learner to explicitly yield a set of unique class probabilities for a testing sample based ...

We analyze the entire publication database of the American Physical Society generating longitudinal (50 years) citation networks geolocalized at the level of single urban areas. We define the knowledge diffusion proxy, and scientific production ranking algorithms to capture the spatio-temporal dynamics of Physics knowledge worldwide. By using the knowledge diffusion proxy we identify the key ci...