This paper addresses the blog distillation problem, that is, given a user query find the blogs that are most related to the query topic. We model each post as evidence of the relevance of a blog to the query, and use aggregation methods like Ordered Weighted Averaging operators to combine the evidence. We show that using only highly relevant evidence (posts) for each blog can result in an effec...

ABSTRACT Nadarajah and Gupta (2004) introduced the beta Fréchet (BF) distribution, which is a generalization of the exponentiated Fréchet (EF) and Fréchet distributions, and obtained the probability density and cumulative distribution functions. However, they do not investigated its moments and the order statistics. In this paper the BF density function and the density function of the order sta...

In this paper we present some new versions of Brooks-Jewett and Dieudonné-type theorems for (l)-group-valued measures.

Andrea Mazzolini, Marco Gherardi, 3 Michele Caselle, Marco Cosentino Lagomarsino, 3, 4 and Matteo Osella∗1 Physics Department and INFN, University of Turin, via P. Giuria 1, 10125 Turin, Italy Sorbonne Universités, UPMC Univ Paris 06, UMR 7238, Computational and Quantitative Biology, 15 rue de l’École de Médecine Paris, France CNRS, UMR 7238, Paris, France FIRC Institute of Molecular Oncology (...

PRODUCTION & DESIGN Head of production Fiona Maclean Senior production editor Julie Hickey Production manager Arnie Beeson Production editors Sarah Howe, Jennifer Oldfi eld Deputy production editor Justin Stevens Sub editors Yvonne Byron Nour, Joyce McKimm, Jennifer Saunders Art directors Ken McLoone, Paul Swainson Deputy art director Minesh Parmar Designer Sujata Aurora Picture editor Philip B...

Institute for Research on Cancer and Aging, Nice (IRCAN), CNRS UMR 7284, INSERM U1081, University of 7 Nice Sophia Antipolis, Nice, France. 8 Wellcome Trust Sanger Institute, Hinxton, Cambridge CB10 1SA, United Kingdom. 9 Department of Chemistry and Molecular Biology, Gothenburg University, Gothenburg 40530, Sweden 10 Sorbonne Universités, UPMC Univ. Paris 06, CNRS, Institut de Biologie Paris-S...

In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as satisfiability of concepts. Whereas tableau-based algorithms usually yield worst-case optimal algorithms in the case of PSpace-complete logics, it is often very hard to design optimal tableau-based algorithms for ExpTi...