In the literature, several scheduling schemes have been proposed for maximizing the system throughput. However, guaranteeing a high fairness appeared as unfeasible without sacrificing system capacity. In this chapter, we have presented an improvement of the PF scheduling scheme yet acknowledged as the most promising so far. This scheme, called “C...
Wireless multi-hop networks are a promising technology to provide flexibility and rapid deployment for connecting the users at low cost. This chapter has examined the issues of link quality aware routing for wireless multi hop networks. Since the quality of wireless communications depends on many different parameters, it can vary dramatically over ...
This chapter reflected on the potential of Virtual Reality and Augmented Reality (VR / AR) technologies in supporting the dynamics of global financial systems and in addressing the grand challenges posed by unexpected events and crisis. The chapter briefly overviewed traditional VR/AR uses and described three early attempts to use 3D/ VR / AR techn...
Opportunistic schedulers take benefit of multiuser and frequency diversity. They preferably allocate the resources to the active mobile(s) with the most favourable channel conditions at a given time. This maximizes the system throughput of OFDM wireless networks. Three major algorithms have emerged: MaxSNR, PF and more recently WFO. However, in spi...
We have shown how one can extract features, curvatures and orientations in frontiers of shapes, from a geometrical wavelets transform. We have also shown how we can use these features to develop two applications of information retrieval. The content based information retrieval system is based on a global information about the handwriting in the doc...
We define a new graph operator, called the weak-factor graph, which comes from the context of complex network modelling. The weak-factor operator is close to the well-known clique-graph operator but it rather operates in terms of bicliques in a multipartite graph. We address the problem of the termination of the series of graphs obtained by iterati...
In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all partitions of an integer, equipped with a dominance ordering. We first explain how this lattice can be constructed...
Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algorithms produce a hierarchical structure of community and seek a partition into communities that optimizes a given quality function. We propose new methods to improve the re...
This paper presents an attempt to provide a generic named-entity recognition and disambiguation module (NERD) called entity-fishing as a stable online service that demonstrates the possible delivery of sustainable technical services within DARIAH, the European digital research infrastructure for the arts and humanities. Deployed as part of the nati...
Discriminative clustering has been successfully applied to a number of weakly-supervised learning tasks. Such applications include person and action recognition, text-to-video alignment, object co-segmentation and co-localization in videos and images. One drawback of dis-criminative clustering, however, is its limited scalability. We address this i...
