Abstract
During the last decade, Computer Poker has become the preferred test-bed for validating developments on the extensive-form game and multi-agent systems research domains. Because Poker is a game with hundreds of variants differing from each other by their betting structure, number of cards in the deck or winning conditions, numerous agents have been created for several different variants of the game. However, there is not a single unified description model that allows for those agents to be tested across different Poker variants inexpensively. For this reason, we introduce the Poker Game Description Language (PGDL), which, unlike other incomplete information GDL's, is uniquely focused on Poker agent development and testing. PGDL is integrated into a playable system which not only makes available a basic Agent Development API in Prolog, but also provides a simple in-built agent which can adapt to user-defined rules. In addition, this framework has a simple GUI which both basic and advanced test subjects demonstrated to be adequate and easy-to-use when defining new PGDL instances. We believe that despite the existence of more generic general game playing systems, the fact that our language natively supplies a shared infrastructure, common to all Poker variants, renders our approach very pertinent for Poker agent development. Tests demonstrated that our language was capable of describing the most popular Poker variants.

Abstract
We prove several results relating injective one-way functions, time-bounded conditional Kolmogorov complexity, and time-bounded conditional entropy. First we establish a connection between injective, strong and weak one-way functions and the expected value of the polynomial time-bounded Kolmogorov complexity, denoted here by E(K-t (x vertical bar f (x))). These results are in both directions. More precisely, conditions on E(K-t (x vertical bar f (x))) that imply that f is a weak one-way function, and properties of E(K-t (x vertical bar f (x))) that are implied by the fact that f is a strong one-way function. In particular, we prove a separation result: based on the concept of time-bounded Kolmogorov complexity, we find an interval in which every function f is a necessarily weak but not a strong one-way function. Then we propose an individual approach to injective one-way functions based on Kolmogorov complexity, defining Kolmogorov one-way functions and prove some relationships between the new proposal and the classical definition of one-way functions, showing that a Kolmogorov one-way function is also a deterministic one-way function. A relationship between Kolmogorov one-way functions and the conjecture of polynomial time symmetry of information is also proved. Finally, we relate E(K-t (x vertical bar f (x))) and two forms of time-bounded entropy, the unpredictable entropy H-unp, in which "one-wayness" of a function can be easily expressed, and the Yao(+) entropy, a measure based on compression/decompression schema in which only the decompressor is restricted to be time-bounded.

Abstract
The Message Passing Interface (MPI) is the de facto standard message-passing infrastructure for developing parallel applications. Two decades after the first version of the library specification, MPI-based applications are nowadays routinely deployed on super and cluster computers. These applications, written in C or Fortran, exhibit intricate message passing behaviours, making it hard to statically verify important properties such as the absence of deadlocks. Our work builds on session types, a theory for describing protocols that provides for correct-by-construction guarantees in this regard. We annotate MPI primitives and C code with session type contracts, written in the language of a software verifier for C. Annotated code is then checked for correctness with the software verifier. We present preliminary results and discuss the challenges that lie ahead for verifying realistic MPI program compliance against session types.

Abstract
Sistemas de suporte à decisão, tecnologias de colaboração, integração, business process management (BPM) e reconstrução do processo de decisão são domínios do conhecimento que se interligam e assumem cada vez maior relevância no contexto organizacional. Tendo como objeto de análise um processo de negócio - gestão do ciclo de vida da rede de mediadores - crítico para uma organização, tentámos perceber qual o nível de suporte atual do mesmo em sistemas de informação (SI) e qual o impacto da adoção de um sistema de suporte à decisão em grupo nesse processo de negócio. A investigação consistiu na decomposição do processo atual, através de análise documental, realização de entrevistas e observação participativa aos seus principais atores, identificando as principais entropias que o afetam: dificuldade de materialização dos modelos de decisão; incapacidade de reconstrução do processo de decisão; elevado peso documental; carências de suporte em SI. Isto permitiu concluir que a adoção de uma plataforma de suporte à decisão em grupo teria um impacto positivo ao suportar a totalidade de um processo de negócio que hoje o está apenas parcialmente, potenciando a integração da informação, o envolvimento dos intervenientes e reduzindo o peso documental associado.

Abstract
Many transportation environmental life cycle analyses neglect the contribution of the energy supply infrastructures. In alternative light duty vehicle technologies, it has been shown through case studies that this can be a relevant factor. However, no model that can generalise the evaluation of energy and emissions from construction, maintenance and decommissioning of such infrastructure to analyse different scenarios currently exists. A model is proposed, focussing on electricity and on hydrogen supply through centralised steam methane reforming (H-2(a)) and on-site electrolysis (H-2(b)). The model outputs are in gCO(2eq)/MJ and MJ(eq)/MJ of the final energy. Model main inputs are the region's electricity mix, the annual distance driven, supply chain losses and the number of vehicles per station or chargers. The evaluation of the number of vehicles served per each charger/station as a function of annual distance driven is presented. The uncertainty is estimated by using the pedigree matrix, impact uncertainty and literature estimates. The model shows consistency in the results and uncertainty range. Charging policies that minimise the electricity infrastructure burden should incentivise approximately 37% of normal charging. H-2(a) pipeline lifetime should be extended. Efforts in the electrolyser should be undertaken to approximate the ratio of vehicles per station with a conventional one.

Abstract
The development of new products or processes involves the creation, re-creation and integration of conceptual models from the related scientific and technical domains. Particularly, in the context of collaborative networks of organisations (CNO) (e.g. a multi-partner, international project) such developments can be seriously hindered by conceptual misunderstandings and misalignments, resulting from participants with different backgrounds or organisational cultures, for example. The research described in this article addresses this problem by proposing a method and the tools to support the collaborative development of shared conceptualisations in the context of a collaborative network of organisations. The theoretical model is based on a socio-semantic perspective, while the method is inspired by the conceptual integration theory from the cognitive semantics field. The modelling environment is built upon a semantic wiki platform. The majority of the article is devoted to developing an informal ontology in the context of a European R&D project, studied using action research. The case study results validated the logical structure of the method and showed the utility of the method.