El método Analytic Hierarchy Process para la toma de decisiones. Repaso de la metodología y aplicaciones

Business and organizational management requires tools to aid in the analysis of complex problems. Managerial decision making usually involves selecting one among multiple alternatives while reconciling the interests of many stakeholders. The objective of this paper is to present a description of the Analytical Hierarchy Process (AHP) method and to introduce real life applications. In a first part, AHP is described from a practical approach, focusing in those aspects that allow an understanding of how it works and the type of problems in which it can be useful. In a second part, several applications of the method compiled from extant literatura are listed, in order to illustrate its versatility for application to different types of management problems. Finally, a brief discussion on AHP and the value of quantitative methods in organizational practice is elaborated.La actividad empresarial, de gobierno y de administración de sistemas organizacionales en general requiere de herramientas para la toma decisiones que permitan definir problemas complejos, estructurarlos, analizar alternativas para resolverlos y seleccionar la más adecuada de ellas conciliando los intereses de múltiples interesados. El objetivo de este trabajo es presentar un repaso del método cuantitativo Analytic Hierarchy Process (AHP) para dar soporte en procesos de decisión en los que se deben tener en cuenta varios criterios y donde existen múltiples alternativas y mostrar además diferentes aplicaciones para las que se ha utilizado la herramienta.  En una primera parte se hace un repaso del método AHP desde un enfoque práctico. No se profundiza en los aspectos matemáticos del método, sino en aquellos que permiten comprender su funcionamiento y el tipo de problemas en los que puede asistir. En una segunda parte se enumeran varias aplicaciones del método recopiladas de la literatura existente, con el objetivo de ilustrar su versatilidad para la aplicación a diferentes tipos de problemas de gestión. Por último, se elabora una breve discusión sobre el método y la importancia de incorporar métodos cuantitativos en la práctica organizacional

Non-Deterministic Functions as Non-Deterministic Processes (Extended Version)

We study encodings of the lambda-calculus into the pi-calculus in the unexplored case of calculi with non-determinism and failures. On the sequential side, we consider lambdafail, a new non-deterministic calculus in which intersection types control resources (terms); on the concurrent side, we consider spi, a pi-calculus in which non-determinism and failure rest upon a Curry-Howard correspondence between linear logic and session types. We present a typed encoding of lambdafail into spi and establish its correctness. Our encoding precisely explains the interplay of non-deterministic and fail-prone evaluation in lambdafail via typed processes in spi. In particular, it shows how failures in sequential evaluation (absence/excess of resources) can be neatly codified as interaction protocols

Non-Deterministic Functions as Non-Deterministic Processes

We study encodings of the λ-calculus into the π-calculus in the unexplored case of calculi with non-determinism and failures. On the sequential side, we consider λ^↯_⊕, a new non-deterministic calculus in which intersection types control resources (terms); on the concurrent side, we consider sπ, a π-calculus in which non-determinism and failure rest upon a Curry-Howard correspondence between linear logic and session types. We present a typed encoding of λ^↯_⊕ into sπ and establish its correctness. Our encoding precisely explains the interplay of non-deterministic and fail-prone evaluation in λ^↯_⊕ via typed processes in sπ. In particular, it shows how failures in sequential evaluation (absence/excess of resources) can be neatly codified as interactio

Termination in Concurrency, Revisited

Termination is a central property in sequential programming models: a term is terminating if all its reduction sequences are finite. Termination is also important in concurrency in general, and for message-passing programs in particular. A variety of type systems that enforce termination by typing have been developed. In this paper, we rigorously compare several type systems for $\pi$-calculus processes from the unifying perspective of termination. Adopting session types as reference framework, we consider two different type systems: one follows Deng and Sangiorgi's weight-based approach; the other is Caires and Pfenning's Curry-Howard correspondence between linear logic and session types. Our technical results precisely connect these very different type systems, and shed light on the classes of client/server interactions they admit as correct

Types and Terms Translated:Unrestricted Resources in Encoding Functions as Processes

Type-preserving translations are effective rigorous tools in the study of core programming calculi. In this paper, we develop a new typed translation that connects sequential and concurrent calculi; it is governed by type systems that control resource consumption. Our main contribution is the source language, a new resource λ-calculus with non-collapsing non-determinism and failures, dubbed uλ^{↯}_{⊕}. In uλ^{↯}_{⊕}, resources are split into linear and unrestricted; failures are explicit and arise from this distinction. We define a type system based on intersection types to control resources and fail-prone computation. The target language is 𝗌π, an existing session-typed π-calculus that results from a Curry-Howard correspondence between linear logic and session types. Our typed translation subsumes our prior work; interestingly, it treats unrestricted resources in uλ^{↯}_{⊕} as client-server session behaviours in 𝗌π

Correction to: Actigraphy assessments of circadian sleep-wake cycles in the Vegetative and Minimally Conscious States.

The original article [1] contains an error affecting the actigraphy time-stamps throughout the article, particularly in Table 1

Two images of Nantes as a ‘Green Model’ of Urban Planning and Governance: The ‘Collaborative City’ Versus the ‘Slow City’

This article examines how the city of Nantes, European Green Capital in 2013, came to promote plans for a new international airport at Notre-Dame-des-Landes. Deploying poststructuralist discourse theory, it analyses how the highly politicised struggle against the airport reveals the limits of the Nantes model of urban sustainability and collaboration, giving rise to a counter model, which we provisionally characterise as the ‘slow city’. While the struggle against the airport can be understood as a rural social movement, we show how its ideals and logics have been progressively displaced to Nantes itself, disclosing new images and possibilities of urban governance