The use of randomly distributed steel fibres in the concrete mix improves its mechanical properties. In the particular case of a flat slab-column connection, this solution can provide slabs with an increased load capacity and deformation capacity, allowing a potential reduction of reinforcement. This work presents the experimental study of the behaviour of SFRC flat slabs up to failure under a concentrated loading, accompanied by the study of the mechanical properties of the SFRC, which consisted in three-point loading notched beams, compression and splitting tests. In this study, the hooked end steel fibre dosages varied between 0{%} and 1.25{%} by volume. Test results showed that the inclusion of steel fibres influences both slab stiffness and its load capacity. Increments of load capacity up to 64{%} were obtained in slabs with SFRC compared with the reference slab without fibres. The experimental results were compared with the predictions provided by several existing models. © 2014 Elsevier Ltd. All rights reserved.

Despite being staggeringly error prone, spreadsheets are a highly flexible programming environment that is widely used in industry. In fact, spreadsheets are widely adopted for decision making, and decisions taken upon wrong (spreadsheet-based) assumptions may have serious economical impacts on businesses, among other consequences. This paper proposes a technique to automatically pinpoint potential faults in spreadsheets. It combines a catalog of spreadsheet smells that provide a first indication of a potential fault, with a generic spectrum-based fault localization strategy in order to improve (in terms of accuracy and false positive rate) on these initial results. Our technique has been implemented in a tool which helps users detecting faults. To validate the proposed technique, we consider a well-known and well-documented catalog of faulty spreadsheets. Our experiments yield two main results: we were able to distinguish between smells that can point to faulty cells from smells and those that are not capable of doing so; and we provide a technique capable of detecting a significant number of errors: two thirds of the cells labeled as faulty are in fact (documented) errors.

This technical report describes the research goals and results of the SpreadSheet as a Programming Paradigm research project. This was a project funded by Funda{\c c}ão para a Ciencia e Tecnologia – FCT: the Portuguese research foundation, under reference FCOMP-01-0124-FEDER-010048, that ran from May 2010 till July 2013. This report includes the complete document reporting the results achieved during the project execution, which was submitted to FCT for evaluation on October 2013. It describes the goals of the project, and the different research tasks presenting the deliver- ables of each of them. It also presents the management and result dissemination work performed during the project's execution. The document includes also a self assess- ment of the achieved results, and a complete list of scientific publications describing the contributions of the project. Finally, this document includes the FCT evaluation report.

Transactional memory (TM) is consistently making its way into mainstream programming, being already deployed by some of the major CPU manufacturers and in several reference compilers. To cope with requirements such as scalability and dependability, recent proposals explore the combination of TM with data replication, bringing TM to distributed environments - conceiving distributed transactional memory (DTM). However, current DTM frameworks support only full data replication. They provide the best possible level of tolerance to data loss, but limit the system's total storage capacity to the capacity of the node with fewer resources, and require coordination among all the system's nodes, an approach bound to hamper scalability in large scale systems. In this context, a partial data replication strategy can help to lessen these shortcomings. Each node replicates only a subset of the system's dataset, an approach that aims at combining the best of data distribution and full replication, while trying to attenuate their disadvantages. The key idea is to allow the dataset to be distributed among the participating nodes and to decrease the number of nodes that have to participate in a transaction's confirmation, as any given transaction only has to be confirmed by the nodes that replicate the data items in its read and write sets. By distributing the data and reducing the coordination cost among nodes, partial data replication leverages the system's scalability. Although this strategy has already been explored by the distributed databases research field, it is yet to be addressed in the context of (D)TM. More specifically, partial data replication has been broadly applied in key-value stores, and even though these work on in-memory data and support transactions, they present significant differences when compared with DTM systems for general purpose programming languages. To this extent, we propose PARdstm, to the best of our knowledge, the first DTM framework to include support for partial data replication. As such, the contributions of this work are: a reasoning on how partial data replication shall be supported in general purpose programming languages (Java, in particular), and a modular software framework that embeds such principles to provide a highly expressive and non-intrusive programming API. Initial experimental results give evidence that our approach may enhance scalability in large scale systems, when compared to full data replication. An ongoing comprehensive study will allow us to assess in which contexts of use (workloads, number of nodes, etc.) partial data replication may be an effective alternative.

Let k be a positive integer and G be a k-connected graph. In 2009, Chartrand, Johns, McKeon, and Zhang introduced the rainbow k-connection number rc_k(G) of G. An edge-coloured path is rainbow if its edges have distinct colours. Then, rc_k(G) is the minimum number of colours required to colour the edges of G so that any two vertices of G are connected by k internally vertex-disjoint rainbow paths. The function rc_k(G) has since been studied by numerous researchers. An analogue of the function rc_k(G) involving vertex colourings, the rainbow vertex k-connection number rvc_k(G), was subsequently introduced. In this paper, we introduce a version which involves total colourings. A total-coloured path is total-rainbow if its edges and internal vertices have distinct colours. The total rainbow k-connection number of G, denoted by trc_k(G), is the minimum number of colours required to colour the edges and vertices of $G$, so that any two vertices of $G$ are connected by $k$ internally vertex-disjoint total-rainbow paths. We study the function trc_k(G) when G is a cycle, a wheel, and a complete multipartite graph. We also compare the functions rc_k(G), rvc_k(G), and trc_k(G), by considering how close and how far apart trc_k(G) can be from rc_k(G) and rvc_k(G).

n/a

Two new Late Jurassic (uppermost Late Kimmeridgian) dinosaur eggshell sites are described, Casal da Rola and Porto das Barcas, both near Lourinha˜, central-west Portugal. Casal da Rola yields eggshells with an obliquiprismatic morphotype comparable to those from a nest with the associated fossil embryos from Paimogo, tentatively assigned to the theropod Lourinhanosaurus antunesi. The Porto das Barcas eggshells have a dendrospherulitic morphotype with a prolatocanaliculate pore system. This morphotype was also recognised in eggshells from a clutch with associated Torvosaurus embryos at the Porto das Barcas locality. A preliminary cladistic analysis of eggshell morphology suggests theropod affinities for the Casal da Rola eggs, but is unable to resolve the phylogenetic position of the Porto das Barcas eggs. The eggshells at both sites are preserved in distal flood plain mudstones and siltstones. Carbonate concretions within the deposits indicate paleosol development.

Reconhecendo o potencial do jogo para a aprendizagem matemática, este estudo pretende analisar o envolvimento e as aprendizagens dos alunos, com o objectivo de caracterizar os jogos com maior potencial para os promover.
Adoptando uma metodologia de índole qualitativa e envolvendo a realização de estudos de caso sobre alunos do 7.ºano, as conclusões alcançadas sugerem que os jogos de computador são particularmente apelativos para os alunos. Contudo, as características determinantes para o envolvimento dos alunos e consequente promoção da aprendizagem prendem-se com a possibilidade de jogar com diferentes níveis de conhecimento e com a obtenção de bons resultados no jogo.

This study addresses the energetic performance of an attached-sunspace applied to an existing residential building in Portugal. Four configurations (two attached, one integrated and one partially integrated) are studied in six different climatic zones. In addition other key parameters are considered such as ventilation (with or without natural ventilation), shading devices (one external and two internal configurations), number of glazed surface layers (single glazed and double glazed) and orientation (South, East and West). The thermal performance analysis, carried out using a dynamic simulation code, proved that energy savings for retrofitting design can be very important and that in climates with warm summers the risk of overheating can be considerably diminished through an accurate analysis based on modeling.

In the face of growing global game production competition, the ability to come out with new ideas to create computer games is widely recognized today as important. In this context, the chance to resort - in a practical way - to known creativity techniques or adaptations of these to help innovation in this field is a promising challenge, both in the field of entertainment games and the so called serious games. In this article we present the development of a research work in this area and the result proposal method for the introduction of creativity in Games Design. The main objective is the construction of innovative Games that have not been identified by the normal methods used in the analysis of games proposals. We present a case study of the method implemented for the identification of new games design opportunities in an MSc Games course.