We propose a set of solutions for managing a large scale RDF semantic repository from the perspective of RDF graph model. A native storage instead of relational database is used to hold RDF. Indices supporting regular path expression, full-text retrieval and partial OWL Lite inference are built above the storage model. Semantic ranking for resources are provided as well.

University rankings generally present users with the problem of placing the results given for an institution in context. Only a comparison with the performance of all other institutions makes it possible to say exactly where an institution stands. In order to interpret the results of the SCImago Institutions Ranking (based on Scopus data) and the Leiden Ranking (based on Web of Science data), i...

This paper presents a new algorithm to compute the set of Pareto solutions in the multiobjective shortest path problem. The main idea consists of ranking lexicographic shortest paths using the Optimality Principle. Some computational results comparing this strategy with the labelling one are also reported.

We find conditions on the order on subsets of a finite set which are necessary and sufficient for the relative ranking of any two subsets in this order to be determined by their extreme elements relative to an abstract convex geometry. It turns out that this question is closely related to the rationalisability of path independent choice functions by hyper-relations.

We propose a simple and efficient scheme for ranking all teams in a tournament, where matches can be played simultaneously. We show that the distribution of the number of rounds of the proposed scheme can be derived by lattice path counting techniques used in ballot problems. We also discuss our method from the viewpoint of parallel sorting algorithms.

The concept of safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on the hypercube is based on the distance of a pair of nodes. However, the distance measure cannot be applied on star graphs directly, since there are many routing path patterns when the distances of two pairs of nodes are the same. Thus, on star graphs, we define the safety ve...

Intermittently connected mobile network (ICMN) is a delaytolerant ad hoc network that is made up of mobile nodes. Here most of the time there does not exist a complete path from source to destination, or such a path is highly unstable and may break soon after it has been discovered. Extreme mobility may render a complete path discovery highly inefficient. In these networks, there is usually no ...

Shortest path problem where the costs have vague values is one of the most studied problems in fuzzy sets and systems area. However, due to its high computational complexity, previously published algorithms present peculiarities and problems that need to be addressed (e.g. they find costs without an existing path, they determine a fuzzy solution set but do not give any guidelines to help the de...

This paper presents two new types of fuzzy shortest-path network problems. We consider the edge weight of the network as uncertain, which means that it is either imprecise or unknown. Thus, the first type of fuzzy shortest-path problem uses triangular fuzzy numbers for the imprecise problem. The second type uses level (1 − β, 1 − α) interval-valued fuzzy numbers, which are based on past statist...

This work is a survey on a special minsum-maxmin bicriteria problem, known as the quickest path problem, that can model the transmission of data between two nodes of a network. Moreover, the authors review the problems of ranking the K quickest paths, and the K quickest loopless paths, and compare them in terms of the worst-case complexity order. The classification presented led to the proposal...