4,075 research outputs found

    The Classics of the First Lorenzo de' Medici. For a New Critical Reading of Corinth

    No full text
    openIl presente lavoro si propone di rileggere una delle prime opere di Lorenzo de’ Medici, "Corinto", attraverso temi letterari che lo caratterizzano, tenendo presente i modelli latini, greci e italiani ai quali l’autore attinge e confrontandone altri, pertinenti ai temi analizzati. Dopo una rapida introduzione sul contesto storico in cui il poemetto si inserisce, esso viene presentato per quanto concerne il contenuto e la storia redazionale, approfondita nell’Appendice, dove si presentano inoltre i testi di riferimento. Segue dunque la nuova lettura critica. La riflessione sul concetto di classico e su Lorenzo quale autore e personaggio del poemetto conclude l’analisi.The present work aims to re-read one of Lorenzo de’ Medici’s first works, "Corinto", through the literary themes which characterize it, keeping in mind the Latin, Greek and Italian models on which the author draws and comparing others, pertinent to the themes analyzed. After a quick introduction to the historical context in which the poem fits, it is presented in terms of content and editorial history, detailed in the Appendix, where the reference texts are also presented. Thus follows the new critical reading. The reflection on the concept of classic and on Lorenzo as author and character of the poem concludes the analysis

    Cooperative Online Native Advertisement: a Game Theoretical Scheme Leveraging on Popularity Dynamics

    No full text
    We propose a model for native online advertising, a recent technique able to safeguard user's online experience and yet greatly accelerate the virality of a content. As of now, the cost of native advertisement represents a high entrance barrier for potential customers of advertisement hosts. In this paper, we argue that cooperative schemes can lower this entrance barrier. In fact, when different content providers (CPs) advertise their products on the same web-page, virality of the web-page itself can boost the number of potential customers, causing a non linear dynamics in the revenue of CPs. By utilizing a cooperative game theoretical framework, we derive a sufficient condition, depending on system's parameters, under which it is profitable for different CPs to advertise their products together. Under a mild assumption, the condition is also shown necessary

    "Programming" Social Collective Intelligence

    No full text
    Worldwide, societies are seeing rapid change in modes of social interaction and organization. These new interaction modes are predicated on emerging forms of information infrastructure together with rapidly evolving devices, systems, and applications that are ever more deeply interwoven with our social fabri

    Expected flooding time in continuous time edge- markovian graphs

    No full text
    This paper studies the flooding time in evolving undirected graphs where the presence of edges is regulated by independent ON–OFF processes. This class of graphs includes continuous-time edge-Markovian graphs. We first derive the exact expression of the expected flooding time in matrix form, that we specialize in the large scale and quasi-sparse (i.e., when the edges are ON for a small time) regimes. The analysis is extended to the more general case where nodes are independently idle with some probability. A lower and an upper bound for the flooding time that can be computed with reduced complexity are then proposed. We claim that our general results can be applied to analyze the information diffusion speed in social and telecommunication networks, as well as the spreading of infection in epidemic networks

    The Italian Coffee Queue: A dynamic priority discipline for multi-class queues

    No full text
    The Italian Coffee Queue (ICQ) models two different customers sending jobs to a queue and competing with one another to have their jobs served first. Jobs arrive at a given Poisson rate. Each job can either wait at the tail of the queue or else jump ahead to tag along waiting jobs belonging to the same class. This comes at a fee paid to the competing customer. On the other hand, the server incurs a switching cost when serving two consecutive jobs belonging to different classes. It follows that the server's switching cost is minimized when all jobs of both classes jump the queue - whenever possible - w.p.1. We formulate the game between the two customers and we provide necessary and sufficient conditions under which the Nash equilibrium between the customers coincides with the server's optimal operating point
    corecore