Recommender Systems by means of Information Retrieval

In this paper we present a method for reformulating the Recommender Systems problem in an Information Retrieval one. In our tests we have a dataset of users who give ratings for some movies; we hide some values from the dataset, and we try to predict them again using its remaining portion (the so-called "leave-n-out approach"). In order to use an Information Retrieval algorithm, we reformulate this Recommender Systems problem in this way: a user corresponds to a document, a movie corresponds to a term, the active user (whose rating we want to predict) plays the role of the query, and the ratings are used as weigths, in place of the weighting schema of the original IR algorithm. The output is the ranking list of the documents ("users") relevant for the query ("active user"). We use the ratings of these users, weighted according to the rank, to predict the rating of the active user. We carry out the comparison by means of a typical metric, namely the accuracy of the predictions returned by the algorithm, and we compare this to the real ratings from users. In our first tests, we use two different Information Retrieval algorithms: LSPR, a recently proposed model based on Discrete Fourier Transform, and a simple vector space model

Flow Stability of Patchy Vector Fields and Robust Feedback Stabilization

The paper is concerned with patchy vector fields, a class of discontinuous, piecewise smooth vector fields that were introduced in AB to study feedback stabilization problems. We prove the stability of the corresponding solution set w.r.t. a wide class of impulsive perturbations. These results yield the robusteness of patchy feedback controls in the presence of measurement errors and external disturbances.Comment: 22 page

Nearly Optimal Patchy Feedbacks for Minimization Problems with Free Terminal Time

The paper is concerned with a general optimization problem for a nonlinear control system, in the presence of a running cost and a terminal cost, with free terminal time. We prove the existence of a patchy feedback whose trajectories are all nearly optimal solutions, with pre-assigned accuracy.Comment: 13 pages, 3 figures. in v2: Fixed few misprint

Scalar curvature and asymptotic Chow stability of projective bundles and blowups

The holomorphic invariants introduced by Futaki as obstruction to the asymptotic Chow semistability are studied by an algebraic-geometric point of view and are shown to be the Mumford weights of suitable line bundles on the Hilbert scheme. These invariants are calculated in two special cases. The first is a projective bundle over a curve of genus at least two, and it is shown that it is asymptotically Chow polystable (with every polarization) if and only the underlying vector bundle is slope polystable. This proves a conjecture of Morrison with the extra assumption that the involved polarization is sufficiently divisible. Moreover it implies that a projective bundle is asymptotically Chow polystable (with every polarization) if and only if it admits a constant scalar curvature Kaehler metric. The second case is a manifold blown-up at points, and new examples of asymptotically Chow unstable constant scalar curvature Kaehler classes are given.Comment: 15 page

Counterpart semantics for a second-order mu-calculus

We propose a novel approach to the semantics of quantified μ-calculi, considering models where states are algebras; the evolution relation is given by a counterpart relation (a family of partial homomorphisms), allowing for the creation, deletion, and merging of components; and formulas are interpreted over sets of state assignments (families of substitutions, associating formula variables to state components). Our proposal avoids the limitations of existing approaches, usually enforcing restrictions of the evolution relation: the resulting semantics is a streamlined and intuitively appealing one, yet it is general enough to cover most of the alternative proposals we are aware of

Geometry for a `penguin-albatross' rookery

We introduce a simple ecological model describing the spatial organization of two interacting populations whose individuals are indifferent to conspecifics and avoid the proximity to heterospecifics. At small population densities $\Phi$ a non-trivial structure is observed where clusters of individuals arrange into a rhomboidal bipartite network with an average degree of four. For $\Phi\rightarrow0$ the length scale, order parameter and susceptibility of the network exhibit power-law divergences compatible with hyper-scaling, suggesting the existence of a zero density - non-trivial - critical point. At larger densities a critical threshold $\Phi_{c}$ is identified above which the evolution toward a partially ordered configuration is prevented and the system becomes jammed in a fully mixed state