Georeferencing Road Accidents with Google Earth: Transforming Information into Knowledge for Decision Support

Over the last fifty years mobility practices have changed dramatically, improving the way travel takes place, the time it takes but also on matters like road safety and prevention. High mortality caused by high accident levels has reached untenable levels. But the research into road mortality stayed limited to comparative statistical exercises which go no further than defining accident types. In terms of sharing information and mapping accidents, little progress has been mad, aside from the normal publication of figures, either through simplistic tables or web pages. With considerable technological advances on geographical information technologies, research and development stayed rather static with only a few good examples on dynamic mapping. The use of Global Positioning System (GPS) devices as normal equipments on automobile industry resulted in a more dynamic mobility patterns but also with higher degrees of uncertainty on road traffic. This paper describes a road accident georeferencing project for the Lisbon District involving fatalities and serious injuries during 2007. In the initial phase, individual information summaries were compiled giving information on accidents and its majour characteristics, collected by the security forces: the Public Safety Police Force (Polícia de Segurança Pública - PSP) and the National Guard (Guarda Nacional Republicana - GNR). The Google Earth platform was used to georeference the information in order to inform the public and the authorities of the accident locations, the nature of the location, and the causes and consequences of the accidents. This paper also gives future insights about augmented reality technologies, considered crucial to advances to road safety and prevention studies. At the end, this exercise could be considered a success because of numerous consequences, as for stakeholders who decide what to do but also for the public awareness to the problem of road mortality.

Machine ethics via logic programming

Machine ethics is an interdisciplinary field of inquiry that emerges from the need of imbuing autonomous agents with the capacity of moral decision-making. While some approaches provide implementations in Logic Programming (LP) systems, they have not exploited LP-based reasoning features that appear essential for moral reasoning. This PhD thesis aims at investigating further the appropriateness of LP, notably a combination of LP-based reasoning features, including techniques available in LP systems, to machine ethics. Moral facets, as studied in moral philosophy and psychology, that are amenable to computational modeling are identified, and mapped to appropriate LP concepts for representing and reasoning about them. The main contributions of the thesis are twofold. First, novel approaches are proposed for employing tabling in contextual abduction and updating – individually and combined – plus a LP approach of counterfactual reasoning; the latter being implemented on top of the aforementioned combined abduction and updating technique with tabling. They are all important to model various issues of the aforementioned moral facets. Second, a variety of LP-based reasoning features are applied to model the identified moral facets, through moral examples taken off-the-shelf from the morality literature. These applications include: (1) Modeling moral permissibility according to the Doctrines of Double Effect (DDE) and Triple Effect (DTE), demonstrating deontological and utilitarian judgments via integrity constraints (in abduction) and preferences over abductive scenarios; (2) Modeling moral reasoning under uncertainty of actions, via abduction and probabilistic LP; (3) Modeling moral updating (that allows other – possibly overriding – moral rules to be adopted by an agent, on top of those it currently follows) via the integration of tabling in contextual abduction and updating; and (4) Modeling moral permissibility and its justification via counterfactuals, where counterfactuals are used for formulating DDE.

The antecedents of post-initial adoption behavior in a S-D logic context

Repercussions of innovation adoption and diffusion studies have long been imperative to the success of novel introductions. However, perceptions and deductions of current innovation understandings have been changing over time. The paradigm shift from the goods-dominant (G-D) logic to the service-dominant (S-D) logic potentially makes the distinction between product (goods) innovation and service innovation redundant as the S-D logic lens views all innovations as service innovations (Vargo and Lusch, 2004; 2008; Lusch and Nambisan, 2015). From this perspective, product innovations are in essence service innovations, as goods serve as mere distribution mechanisms to deliver service. Nonetheless, the transition to such a broadened and transcending view of service innovation necessitates concurrently a change in the underlying models used to investigate innovation and its subsequent adoption. The present research addresses this gap by engendering a novel model for the most crucial period of service diffusion within the S-D logic context – the post-initial adoption phase, which demarcates an individual’s behavior after the initial adoption decision of a service. As a wellfounded understanding of service diffusion and the complementary innovation adoption still lingers in its infancy, the current study develops a model based on interdisciplinary domains mapping. Here fore, knowledge of the relatively established viral source domain is mapped to the comparatively undetermined target domain of service innovation adoption. To assess the model and test the importance of the explanatory variables, survey data from 750 respondents of a bank in Northern Germany is scrutinized by means of Structural Equation Modeling (SEM). The findings reveal that the continuance intention of a customer, actual usage of the service and the customer influencer value all constitute important postinitial adoption behavior that have meaningful implications for a successful service adoption. Second, the four constructs customer influencer value, organizational commitment, perceived usefulness and service customization are evidenced to have a differential impact on a iv customer’s post-initial adoption behavior. Third, this study indicates that post-initial adoption behavior further underlies the influence of a user’s age and besides that is also provoked by the internal and external environments of service adoption. Finally, this research amalgamates the broad view of service innovation by Nambisan and Lusch (2015) with the findings ensuing this enquiry’s model to arrive at a framework that it both, generalizable and practically applicable. Implications for academia and practitioners are captured along with avenues for future research.

Semantics of logic programs with explicit negation

After a historical introduction, the bulk of the thesis concerns the study of a declarative semantics for logic programs. The main original contributions are: ² WFSX (Well–Founded Semantics with eXplicit negation), a new semantics for logic programs with explicit negation (i.e. extended logic programs), which compares favourably in its properties with other extant semantics. ² A generic characterization schema that facilitates comparisons among a diversity of semantics of extended logic programs, including WFSX. ² An autoepistemic and a default logic corresponding to WFSX, which solve existing problems of the classical approaches to autoepistemic and default logics, and clarify the meaning of explicit negation in logic programs. ² A framework for defining a spectrum of semantics of extended logic programs based on the abduction of negative hypotheses. This framework allows for the characterization of different levels of scepticism/credulity, consensuality, and argumentation. One of the semantics of abduction coincides with WFSX. ² O–semantics, a semantics that uniquely adds more CWA hypotheses to WFSX. The techniques used for doing so are applicable as well to the well–founded semantics of normal logic programs. ² By introducing explicit negation into logic programs contradiction may appear. I present two approaches for dealing with contradiction, and show their equivalence. One of the approaches consists in avoiding contradiction, and is based on restrictions in the adoption of abductive hypotheses. The other approach consists in removing contradiction, and is based in a transformation of contradictory programs into noncontradictory ones, guided by the reasons for contradiction.

Concurrent tabling

In the past few years Tabling has emerged as a powerful logic programming model. The integration of concurrent features into the implementation of Tabling systems is demanded by need to use recently developed tabling applications within distributed systems, where a process has to respond concurrently to several requests. The support for sharing of tables among the concurrent threads of a Tabling process is a desirable feature, to allow one of Tabling’s virtues, the re-use of computations by other threads and to allow efficient usage of available memory. However, the incremental completion of tables which are evaluated concurrently is not a trivial problem. In this dissertation we describe the integration of concurrency mechanisms, by the way of multi-threading, in a state of the art Tabling and Prolog system, XSB. We begin by reviewing the main concepts for a formal description of tabled computations, called SLG resolution and for the implementation of Tabling under the SLG-WAM, the abstract machine supported by XSB. We describe the different scheduling strategies provided by XSB and introduce some new properties of local scheduling, a scheduling strategy for SLG resolution. We proceed to describe our implementation work by describing the process of integrating multi-threading in a Prolog system supporting Tabling, without addressing the problem of shared tables. We describe the trade-offs and implementation decisions involved. We then describe an optimistic algorithm for the concurrent sharing of completed tables, Shared Completed Tables, which allows the sharing of tables without incurring in deadlocks, under local scheduling. This method relies on the execution properties of local scheduling and includes full support for negation. We provide a theoretical framework and discuss the implementation’s correctness and complexity. After that, we describe amethod for the sharing of tables among threads that allows parallelism in the computation of inter-dependent subgoals, which we name Concurrent Completion. We informally argue for the correctness of Concurrent Completion. We give detailed performance measurements of the multi-threaded XSB systems over a variety of machines and operating systems, for both the Shared Completed Tables and the Concurrent Completion implementations. We focus our measurements inthe overhead over the sequential engine and the scalability of the system. We finish with a comparison of XSB with other multi-threaded Prolog systems and we compare our approach to concurrent tabling with parallel and distributed methods for the evaluation of tabling. Finally, we identify future research directions.

A Logic and tool for local reasoning about security protocols

Trabalho apresentado no âmbito do Mestrado em Engenharia Informática, como requisito parcial para obtenção do grau de Mestre em Engenharia Informática

Algorithms and methodologies for decision support in energy efficiency on buildings

Dissertação apresentada na faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do grau de Mestre em Engenharia Electrotécnica e de Computadores

Intelligent decision support systems for collaboration in industrial plants

Dissertação apresentada para obtenção do Grau de Doutor em Sistemas de Informação Industriais, Engenharia Electrotécnica, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

The Vasco da Gama Bridge on the Tagus Estuary: A paradigm of bad decision making, but good post-evaluation

World Transport Policy & Practice, Vol.6, nº2, (2000)

Every normal logic program has a 2-valued semantics: theory, extensions, applications, implementations

Trabalho apresentado no âmbito do Doutoramento em Informática, como requisito parcial para obtenção do grau de Doutor em Informática

How composite indicators of innovation can influence technology policy decision?

Based on the report for Project III of the PhD programme on Technology Assessment and prepared for the Winter School that took place at Universidade Nova de Lisboa, Caparica Campus on the 6th and 7th of December 2010.

Municipal solid waste management system: decision support through systems analysis

Thesis submitted to the Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia for the degree of Doctor of Philosophy in Environmental Engineering

Decision making processes based on innovation indicators: which implications for technology assessment?

Based on the report for “Project IV” unit of the PhD programme on Technology Assessment. This thesis research has the supervision of António Moniz (FCT-UNL and ITAS-KIT) and Manuel Laranja (ISEG-UTL). Other members of the thesis committee are Stefan Kuhlmann (Twente University), Leonhard Hennen (Karlsruhe Institute of Technology-ITAS), Tiago Santos Pereira (Universidade de Coimbra/CES) and Cristina Sousa (FCT-UNL).

Decision-making process in radiology: the magnetic resonance example in the TA context

Based on the report for “Project IV” unit of the PhD programme on Technology Assessment (Doctoral Conference) at Universidade Nova de Lisboa (December 2011). This thesis research has the supervision of António Moniz (FCT-UNL and ITAS-KIT) and Michael Decker (Karlsruhe Institute of Technology-ITAS). Other members of the thesis committee are Carlos Alberto da Silva (University of Évora), José Maria de Albuquerque (Institute of Welding and Quality), Lotte Steuten (University of Twente), Mário Forjaz Secca (FCT-UNL) and Nelson Chibeles Martins (FCT-UNL).

Risk-based decision support system for life cycle management of industrials plants

Dissertação para obtenção do Grau de Doutor em Engenharia Electrotécnica e de Computadores