On mappings preserving the sharp and star orders

The present paper is devoted to the study of linear maps preserving certain relations, such as the sharp partial order and the star partial order in semisimple Banach algebras and C*-algebras.

Examining mindfulness and its relation to self-differentiation and alexithymia

Published online first in 10 July 2013

Column-based databases: estudo exploratório no âmbito das bases de dados NoSQL

Dissertação de mestrado integrado em Engenharia e Gestão de Sistemas de Informação

Sinistralidade rodoviária e o marketing relacional: perspetivas de soluções mais eficazes no seu combate em Portugal

Dissertação de mestrado em Marketing e Estratégia

Document-based databases: estudo comparativo no âmbito das bases de dados NoSql

Dissertação de mestrado integrado em Engenharia e Gestão de Sistemas de Informação

A cooperação transfronteiriça como oportunidade de desenvolvimento das regiões de fronteira. Da Raia Ibérica à euroregião Galiza-Norte de Portugal

Tese de Doutoramento em Geografia Humana.

Redes interorganizacionais nas políticas públicas: atores, conexões e configurações organizacionais

Tese de Doutoramento em Sociologia

A study of risk-aware program transformation

In the trend towards tolerating hardware unreliability, accuracy is exchanged for cost savings. Running on less reliable machines, functionally correct code becomes risky and one needs to know how risk propagates so as to mitigate it. Risk estimation, however, seems to live outside the average programmer’s technical competence and core practice. In this paper we propose that program design by source-to-source transformation be risk-aware in the sense of making probabilistic faults visible and supporting equational reasoning on the probabilistic behaviour of programs caused by faults. This reasoning is carried out in a linear algebra extension to the standard, `a la Bird-Moor algebra of programming. This paper studies, in particular, the propagation of faults across standard program transformation techniques known as tupling and fusion, enabling the fault of the whole to be expressed in terms of the faults of its parts.

Refinement in hybridised institutions

Hybrid logics, which add to the modal description of transition structures the ability to refer to specific states, offer a generic framework to approach the specification and design of reconfigurable systems, i.e., systems with reconfiguration mechanisms governing the dynamic evolution of their execution configurations in response to both external stimuli or internal performance measures. A formal representation of such systems is through transition structures whose states correspond to the different configurations they may adopt. Therefore, each node is endowed with, for example, an algebra, or a first-order structure, to precisely characterise the semantics of the services provided in the corresponding configuration. This paper characterises equivalence and refinement for these sorts of models in a way which is independent of (or parametric on) whatever logic (propositional, equational, fuzzy, etc) is found appropriate to describe the local configurations. A Hennessy–Milner like theorem is proved for hybridised logics.

Exploring scenario exploration

Model finders are very popular for exploring scenarios, helping users validate specifications by navigating through conforming model instances. To be practical, the semantics of such scenario exploration operations should be formally defined and, ideally, controlled by the users, so that they are able to quickly reach interesting scenarios. This paper explores the landscape of scenario exploration operations, by formalizing them with a relational model finder. Several scenario exploration operations provided by existing tools are formalized, and new ones are proposed, namely to allow the user to easily explore very similar (or different) scenarios, by attaching preferences to model elements. As a proof-of-concept, such operations were implemented in the popular Alloy Analyzer, further increasing its usefulness for (user-guided) scenario exploration.

Factoriality and the pin-reutenauer procedure

We consider implicit signatures over finite semigroups determined by sets of pseudonatural numbers. We prove that, under relatively simple hypotheses on a pseudovariety V of semigroups, the finitely generated free algebra for the largest such signature is closed under taking factors within the free pro-V semigroup on the same set of generators. Furthermore, we show that the natural analogue of the Pin-Reutenauer descriptive procedure for the closure of a rational language in the free group with respect to the profinite topology holds for the pseudovariety of all finite semigroups. As an application, we establish that a pseudovariety enjoys this property if and only if it is full.

A celebração do contrato de seguro à distância

Dissertação de mestrado em Direito dos Contratos e da Empresa

A carta do presidente e o relato voluntário do capital intelectual: análise das empresas do segmento do novo mercado da BM&FBOVESPA

Dissertação de mestrado em Contabilidade

Riscos psicossociais e o seu ompacto na relação de emprego: o papel do envolvimento

Dissertação de mestrado em Psicologia Aplicada

Estudo das ELI dos distritos de Braga e Bragança: um contributo para a avaliação das práticas centradas na família

Dissertação de mestrado em Educação Especial (área de especialização em Intervenção Precoce)