In social play, young children can exhibit different types of participation. Some children are engaged with other children in the play activity while others are just looking. In this study, we investigated methods to automatically predict the children’s levels of participation in play settings using nonverbal vocal features (which have been shown to correlate with related phenomena such as enga...

This paper presents three simple and efficient algorithms for generating, ranking and unranking t-ary trees in a lexicographic order. The simplest idea of encoding a t-ary tree with n nodes as a bit-string of length t*n is exploited to its full advantages. It is proved that the lexicographic order in the set of t-ary trees with n nodes is preserved in the set of bit-strings of length t*n, using...

This paper describes the participation of the INRIA group in the INEX 2007 XML entity ranking and ad hoc tracks. We developed a system for ranking Wikipedia entities in answer to a query. Our approach utilises the known categories, the link structure of Wikipedia, as well as the link co-occurrences with the examples (when provided) to improve the effectiveness of entity ranking. Our experiments...

Triple stores have long provided RDF storage as well as data access using expressive, formal query languages such as SPARQL. The new end users of the Semantic Web, however, are mostly unaware of SPARQL and overwhelmingly prefer imprecise, informal keyword queries for searching over data. At the same time, the amount of data on the Semantic Web is approaching the limits of the architectures that...

Qualifying and ranking threat degrees of vulnerabilities in cloud service are known to be full of challenges. Although there have been several efforts aiming to address this problem, most of them are too simple or cannot be applied into cloud infrastructure. This paper aims to propose a novel framework to qualify and rank the vulnerabilities based on their threat degrees in cloud service. Throu...

Search engines split large datasets across multiple machines using document distribution. Documents are typically distributed randomly to produce good load balancing. We propose that documents be distributed by their size instead. This can make load balancing more difficult, but it produces immediate improvements in both index size and query throughput. To support our proposal, we show improvem...

One can use the Leiden Rankings for grouping research universities by considering universities which are not significantly different as a homogeneous set. Such groupings reduce the complexity of the rankings without losing information. We pursue this classification using both statistical significance and effect sizes of differences among 902 universities in 54 countries; we focus on the UK, Ger...

The exchangeability assumption as defined in this paper on ranking functions seems intuitively natural, and indeed, specific ranking functions previously proposed in the literature are all exchangeable. While pointwise ranking functions are vacuously exchangeable, we now discuss two specifically listwise ranking functions previously proposed by [22] and [26] in light of our representation theor...

This paper is a continuation of the study of surprise as a base for constructing qualitative calculi for representing and reasoning about uncertain knowledge. Here, we further elaborate on κ, a qualitative ranking function which we developed in (Ibrahim, Tawfik, and Ngom 2009b) and which constructs qualitative ranks for events by obtaining the order of magnitude abstraction of the degree of sur...

Google Scholar is one of the major academic search engines but its ranking algorithm for academic articles is unknown. We performed the first steps to reverse-engineering Google Scholar’s ranking algorithm and present the results in this research-in-progress paper. The results are: Citation counts is the highest weighed factor in Google Scholar’s ranking algorithm. Therefore, highly cited artic...