For one-sided matching problems, two widely studied mechanisms are the Random Serial Dictatorship (RSD) and the Probabilistic Serial Rule (PS). The induced outcomes of these two mechanisms are often incomparable and thus there are challenges when it comes to deciding which mechanism to adopt in practice. Working in the space of general preferences, we provide empirical results on the (in)compar...

This paper describes the methods we have employed to solve the author profiling task at PAN-2013. Our goal was to use simple features to identify the age group and the gender of the author of a given text. We introduce the features, detail how the classifiers were trained, and how the experiments were run.

A robust image similarity measure is presented for patterned triangles. A novel feature of the new similarity measure is the reduction of the patterns to a simple set of affine-invariant bar-codes.

1. INTRODUCTION II [1] two of us iivestigated the problem of determiiiig those cardiials a, /3, y, 8, A for which the followiig statemeet, abbreviated Iá(8, g, a, A, y), holds : "Wheeever V is aa a-dimeesiooal vector space over a field of A elemeets, aad the 8-dimeesiooal subspaces of V are partitiooed iito y classes, there is some /-dimeesiooal subspace of V all of whose 8-dimee-siooal subspac...

The sliding three-tube (S3T) model, based on Fant’s acoustic theory and proposed in our previous studies, has a simple structure, enabling it to produce human-like vowels useful for education in acoustics and speech science. In this study, we changed the size of the S3T model and combined it with sound sources with different fundamental frequencies. We confirmed that the models could produce vo...

A signed graph has edge weights drawn from the set $\{+1,-1\}$, and is termed sign-balanced if it equivalent to an unsigned under operation of sign switching; otherwise called sign-unbalanced. nut a one dimensional kernel with corresponding eigenvector that full. In this paper we generalise notion graphs graphs. Orders for which regular exist were determined recently degrees up $11$. By extendi...

Let $$G=(V,E)$$ be a finite graph (here V and E denote the set of vertices edges G respectively) $$M_G$$ centered Hardy–Littlewood maximal operator defined there. We find optimal value $$\mathbf{{C}}_{G,p}$$ such that inequality $$\begin{aligned} \mathrm{Var\,}_{p}M_{G}f\le \mathbf{C}_{G,p}\mathrm{Var\,}_{p}f \end{aligned}$$ holds for every $$f:V\rightarrow {\mathbb {R}},$$ where $$\mathrm{Var\...