1,513 research outputs found

    Do corporations have a duty to be trustworthy?

    Get PDF
    Since the global financial crisis in 2008, corporations have faced a crisis of trust, with growing sentiment against ‘elites and ‘big business’ and a feeling that ‘something ought to be done’ to re-establish public regard for corporations. Trust and trustworthiness are deeply moral significant. They provide the ‘glue or lubricant’ that begets reciprocity, decreases risk, secures dignity and respect, and safeguards against the subordination of the powerless to the powerful. However, in deciding how to restore trust, it is difficult to determine precisely what should be done, by whom, and who will bear the cost, especially if any action involves a risk to overall market efficiency and corporate profitability. The paper explores whether corporations have a moral duty to be trustworthy, to bear the cost of being so and thus contribute to resolving the current crisis of trust. It also considers where the state and other social actors have strong reason to protect and enforce such moral rights, while acknowledging that other actors have similar obligations to be trustworthy. It outlines five ‘salient factors’ that trigger specific rights to trustworthiness and a concomitant duty on corporations to be trustworthy: market power, subordination (threat and intimidation), the absence of choice, the need to preserve systemic trust, and corporate political power which might undermine a state’s legitimacy. Absent these factors and corporations do not have a general duty to be trustworthy, since a responsible actor in fair market conditions should be able to choose between the costs and benefits of dealing with generally trustworthy corporations

    A Middleware Framework for Constraint-Based Deployment and Autonomic Management of Distributed Applications

    Get PDF
    We propose a middleware framework for deployment and subsequent autonomic management of component-based distributed applications. An initial deployment goal is specified using a declarative constraint language, expressing constraints over aspects such as component-host mappings and component interconnection topology. A constraint solver is used to find a configuration that satisfies the goal, and the configuration is deployed automatically. The deployed application is instrumented to allow subsequent autonomic management. If, during execution, the manager detects that the original goal is no longer being met, the satisfy/deploy process can be repeated automatically in order to generate a revised deployment that does meet the goal.Comment: Submitted to Middleware 0

    A middleware framework for constraint-based deployment and autonomic management of distributed applications

    Get PDF
    Submitted to Middleware 04 Funded by the EPSRC UK grant GR/S44501 "Secure LocationIndependent Autonomic Storage Architectures"We propose a middleware framework for deployment and subsequent autonomic management of component-based distributed applications. An initial deployment goal is specified using a declarative constraint language, expressing constraints over aspects such as component-host mappings and component interconnection topology. A constraint solver is used to find a configuration that satisfies the goal, and the configuration is deployed automatically. The deployed application is instrumented to allow subsequent autonomic management. If, during execution, the manager detects that the original goal is no longer being met, the satisfy/deploy process can be repeated automatically in order to generate a revised deployment that does meet the goal

    Applying constraint solving to the management of distributed applications

    Get PDF
    Submitted to DOA08We present our approach for deploying and managing distributed component-based applications. A Desired State Description (DSD), written in a high-level declarative language, specifies requirements for a distributed application. Our infrastructure accepts a DSD as input, and from it automatically configures and deploys the distributed application. Subsequent violations of the original requirements are detected and, where possible, automatically rectified by reconfiguration and redeployment of the necessary application components. A constraint solving tool is used to plan deployments that meet the application requirements.Postprin

    Tiempo, espacio y acción colectiva : espacio político/geografía política

    Get PDF
    Cet article n'a pas pour object d'exposer une histoire de la géographie politique ni même d'offrir des données sur la présente renaissance de la discipline. Il s'agit plutôt de discuter d'abord en quoi consiste la géographie politique, ce qui dépend de l'analyse de certaines problematiques clé. En second lieu, on discute sur ce qu'une définition impose a notre practique de recherche. Troisièmement, on examine un texte récent de l'historien Charles Tilly sur la formation de l'état, qui nous ressemble une reformulation de la géographie politique.Political geography's renaissance has been rehearsed now a number of times, and neither the disciplinary history, nor evidence for revival, will be offered here. Instead, this paper confronts some differente issues, the first of which is an attempted resolution of what political geography is, a task that depends upon an analysis of some key problematics. The second task follows logically from the first, and involves discussion of what a definition dictates for our research practice. The third is a continuation of this theme, in the form of a review of a recent manuscript by historian Charles Tilly, on the question of state formation, which serves as a catalyst to a discussion of what a reformulation of political geography might look like.El renacimiento de la geografia política ya ha ocurrido en algunas ocasiones y en este trabajo no se ofrecera ni una historia de la disciplina ni ningún dato sobre su resurgimiento. En lugar de ello, el articulo trata de diversos temas diferentes, y la primera tarea consiste en determinar qué es la geografia política, objetivo que depende del analisis de la problemática clave. La segunda tarea se deriva lógicamente de la primera e implica la discusión de cómo una definición determinada condiciona la practica de nuestra investigación. La tercera es una continuación de este tema y examina una obra reciente dels historiador Charles Tilly sobre la formación de los Estados, tema que nos sirve de catalizador para discutir a qué podria parecerse una reformulación de la geografia politica.El renaixement de la geografia política ja s'ha donat en diverses ocasions i aquí no oferiré ni una historia de la disciplina ni cap dada sobre el seu ressorgiment. En lloc d'això, aquest article tracta de diversos temes diferents, i la primera tasca consisteix a intentar determinar que és la geografia política, objectiu que depèn de l'analisi de problemàtiques clau. La segona tasca es deriva logicament de la primera i implica la discussió de com una definició determinada condiciona la practica de la nostra recerca. La tercera és una continuació d'aquest tema i examina una obra recent de l'historiador Charles Tilly sobre la formació dels Estats, tema que ens serveix de catalitzador per discutir a que podria assemblar una reformulació de la geografia política

    A Peer-to-Peer Middleware Framework for Resilient Persistent Programming

    Get PDF
    The persistent programming systems of the 1980s offered a programming model that integrated computation and long-term storage. In these systems, reliable applications could be engineered without requiring the programmer to write translation code to manage the transfer of data to and from non-volatile storage. More importantly, it simplified the programmer's conceptual model of an application, and avoided the many coherency problems that result from multiple cached copies of the same information. Although technically innovative, persistent languages were not widely adopted, perhaps due in part to their closed-world model. Each persistent store was located on a single host, and there were no flexible mechanisms for communication or transfer of data between separate stores. Here we re-open the work on persistence and combine it with modern peer-to-peer techniques in order to provide support for orthogonal persistence in resilient and potentially long-running distributed applications. Our vision is of an infrastructure within which an application can be developed and distributed with minimal modification, whereupon the application becomes resilient to certain failure modes. If a node, or the connection to it, fails during execution of the application, the objects are re-instantiated from distributed replicas, without their reference holders being aware of the failure. Furthermore, we believe that this can be achieved within a spectrum of application programmer intervention, ranging from minimal to totally prescriptive, as desired. The same mechanisms encompass an orthogonally persistent programming model. We outline our approach to implementing this vision, and describe current progress.Comment: Submitted to EuroSys 200

    RAFDA: A Policy-Aware Middleware Supporting the Flexible Separation of Application Logic from Distribution

    Get PDF
    Middleware technologies often limit the way in which object classes may be used in distributed applications due to the fixed distribution policies that they impose. These policies permeate applications developed using existing middleware systems and force an unnatural encoding of application level semantics. For example, the application programmer has no direct control over inter-address-space parameter passing semantics. Semantics are fixed by the distribution topology of the application, which is dictated early in the design cycle. This creates applications that are brittle with respect to changes in distribution. This paper explores technology that provides control over the extent to which inter-address-space communication is exposed to programmers, in order to aid the creation, maintenance and evolution of distributed applications. The described system permits arbitrary objects in an application to be dynamically exposed for remote access, allowing applications to be written without concern for distribution. Programmers can conceal or expose the distributed nature of applications as required, permitting object placement and distribution boundaries to be decided late in the design cycle and even dynamically. Inter-address-space parameter passing semantics may also be decided independently of object implementation and at varying times in the design cycle, again possibly as late as run-time. Furthermore, transmission policy may be defined on a per-class, per-method or per-parameter basis, maximizing plasticity. This flexibility is of utility in the development of new distributed applications, and the creation of management and monitoring infrastructures for existing applications.Comment: Submitted to EuroSys 200

    Mutations causing medullary cystic kidney disease type 1 lie in a large VNTR in MUC1 missed by massively parallel sequencing

    Get PDF
    Although genetic lesions responsible for some mendelian disorders can be rapidly discovered through massively parallel sequencing of whole genomes or exomes, not all diseases readily yield to such efforts. We describe the illustrative case of the simple mendelian disorder medullary cystic kidney disease type 1 (MCKD1), mapped more than a decade ago to a 2-Mb region on chromosome 1. Ultimately, only by cloning, capillary sequencing and de novo assembly did we find that each of six families with MCKD1 harbors an equivalent but apparently independently arising mutation in sequence markedly under-represented in massively parallel sequencing data: the insertion of a single cytosine in one copy (but a different copy in each family) of the repeat unit comprising the extremely long (~1.5–5 kb), GC-rich (>80%) coding variable-number tandem repeat (VNTR) sequence in the MUC1 gene encoding mucin 1. These results provide a cautionary tale about the challenges in identifying the genes responsible for mendelian, let alone more complex, disorders through massively parallel sequencing
    corecore