Paolo Coppola

• PhD
• Professor (Associate) at University of Udine

This paper presents an agent-based model for interacting with regional healthcare system services in the Friuli-Venezia Giulia (FVG) region. The model is designed to streamline and automate tasks traditionally managed through human intervention. We showcase its implementation on three key applications: booking medical appointments, identifying...

Public procurement is a field particularly prone to corrupt acts. In this regard, red flag indicators are developed with the purpose of signalling anomalies and alerting the system for a potential risk of corruption. By exploiting data coming from the Italian National Database of Public Contracts, a set of red flag indicators for the measurement of...

In this paper we aim at clustering Italian contracting authorities in terms of their attitude over time (2015-2017) in managing public procurements, a field particularly prone to the occurrence of corrupt acts. For our purpose we rely on an approach based on red flag indicators, which considers public procurement data and points out possible anomal...

The typical scenario of a user seeking information on the Web requires significant effort to get the desired information (Web pages, applications, resources, and so on). The user must submit a query to a Web search engine and then check the results to see if they really provide the desired information. Often the user must refine and resubmit the qu...

Nowadays, the mobile computing paradigm and the widespread diffusion of mobile devices are quickly changing and replacing many common assumptions about software architectures and interaction/communication models. The environment, in particular, or more generally, the so-called user context is claiming a central role in everyday’s use of cellular ph...

I will present the Context Aware Browser, a novel paradigm for context-aware access to Web contents with mobile devices. The idea is to allow automatic download of Web pages, and even automatic execution of Web applications, on user's own mobile device. The Web resources are not simply pushed on the mobile device; rather, they are selected on the b...

The so-called light logics have been introduced as logical systems enjoying quite remarkable normalization properties. Designing a type assignment system for pure lambda calculus from these logics, however, is problematic. In this paper we show that shifting from usual call-by-name to call-by-value lambda calculus allows regaining strong connection...

Context aware computing is a computational paradigm that has faced a rapid growth in the last few years, especially in the field of mobile devices. One of the promises of context-awareness in this field is the possibility of automatically adapting the functioning mode of mobile devices to the environment and the current situation the user is in, wi...

Web 2.0 marks a new philosophy where user is the main ac- tor and content producer: users write blogs and comments, they tag, link, and upload photos, pictures, videos, and pod- casts. As a step further, Mobile 2.0 adapts Web 2.0 technol- ogy to mobile users. We intend to study how Web 2.0 and Mobile 2.0 together can be applied to the cultural heri...

Web 2.0, also known as the Social Web, marks a new philo- sophy where users are both the main actors and the content producers: users write blogs and comments, they tag, link, and upload photos, pic- tures, videos, and podcasts. As a step further, Mobile 2.0 adapts Web 2.0 technology to mobile users. We intend to study how Web 2.0 and Mobile 2.0 to...

Typing of lambda-terms in elementary and light affine logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL (EAL resp.) proof-nets admits a guaranteed polynomial (elementary, resp.) bound; on the other hand these terms can also be evaluated by optimal reduction using the abstract...

Typing of lambda-terms in elementary and light affine logic (EAL and LAL, respectively) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL (EAL, respectively) proof-nets admits a guaranteed polynomial (elementary, respectively) bound; on the other hand these terms can also be evaluated by optimal red...

Typing of lambda-terms in Elementary and Light Affine Logic (EAL, LAL, resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL (EAL, resp.) proof-nets admits a guaranteed polynomial (elementary, resp.) bound; on the other hand these terms can also be evaluated by optimal reduction using the abstrac...

The so-called light logics [1,2,3] have been introduced as logical systems enjoying quite remarkable normalization properties. Designing a type assignment system for pure lambda calculus from these logics, however, is problematic, as discussed in [4]. In this paper we show that shifting from usual call-by-name to call-by-value lambda calculus allow...

Elementary Affine Logic (EAL) is a variant of Linear Logic characterizing the computa- tional power of the elementary bounded Turing machines. The EAL Type Inference problem is the problem of automatically assigning to terms of -calculus EAL formulas as types. This problem, re- stricted to the propositional fragment of EAL, is proved to be decidabl...

Due to the appearance and widespread diffusion of new mobile devices (PDAs, smartphones etc.), the traditional notion of computing is quickly fading away, giving birth to new paradigms, where concurrent entities, moving from one location to another, exchange data and cooperate to- wards a common goal. Hence, the scientific community is searching fo...

http://www.mobe.it Abstract. Due to the appearance and widespread diffusion of new mobile de- vices (PDAs, smartphones etc.), the traditional notion of computing is quickly fading away, giving birth to new paradigms and to new non-trivial problems. Hence, the scientific community is searching for models, technologies, and ar- chitectures in order t...

Due to the appearance and widespread diffusion of new mobile de-vices (PDAs, smartphones etc.), the traditional notion of computing is quickly fading away, giving birth to new paradigms and to new non-trivial problems. Hence, the scientific community is searching for models, technologies, and ar-chitectures in order to suitably describe and guide t...

We discuss how the wireless-mobile revolution will change the notion of relevance in information retrieval. We distinguish between classical relevance (e-relevance) and relevance for wireless/mobile information retrieval (w-relevance). Starting from a four-dimensional model of e-relevance previously developed by one of us, we discuss how, in an ubi...

We propose a type inference algorithm for lambda terms in elementary affine logic (EAL). The algorithm decorates the syntax tree of a simple typed lambda term and collects a set of linear constraints. The result is a parametric elementary type that can be instantiated with any solution of the set of collected constraints. We point out that the type...

Elementary Affine Logic (EAL) is a variant of the Linear Logic characterizing the computational power of the elementary bounded Turing machines. The EAL Type Inference problem is the problem of automatically assigning to terms of lambda-calculus EAL formulas as types. This problem is proved to be decidable, and an algorithm is showed, building, for...

We discuss how the wireless-mobile revolution will change the notion of relevance in information retrieval. We distinguish between classical relevance (e-relevance) and relevance for wireless/mobile information retrieval (w-relevance). Starting from a four- dimensional model of e-relevance previously developed by one of us, we discuss how, in an ub...

We present a type inference algorithm for λ-terms in Elementary Affine Logic using linear constraints. We prove that the algorithm is correct and complete.

Virtual Reality (VR) interfaces to e-commerce sites promise to make the e-shopping experience more natural, attractive, and fun for buyers. In this paper, we first briefly introduce the navigation problem, then we propose a novel navigation aid to help customers of VR stores in finding products. The proposed aid is based on 3D animated products whi...

In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la Lévy) cannot be bound by any elementary function in the number of shared-beta steps. We prove in this paper that an analogous result holds for Lamping’s abstract algorithm. That is, there is no elementary function in the number of shared...

The process of building and managing digital content (e- content) archives is usually based on an approach that first analyzes the specificity of data, then projects the, usually relational, data base, and finally designs the user interfaces and the set of features of the system. Hence the traditional approach tends to the implementation of specifi...