Some asymptotic expansions not necessarily related to the central limit theorem are studied. We first observe that the smoothing inequality of Esseen implies the proximity, in the Kolmogorov distance sense, of the distributions of the random variables of two random sequences satisfying a sort of general asymptotic relation. We then present several instances of this observation. A first example, partially motivated by the the statistical theory of high precision measurements, is given by a uniform asymptotic approximation to gX + nn∈, where g is some smooth function, X is a random variable and nn∈ is a sequence going to infinity; a multivariate version is also stated and proved. We finally present a second class of examples given by a randomization of the interesting parameter in some classical asymptotic formulas; namely, a generic Laplace’s type integral, randomized by the sequence nXn∈, X being a Gamma distributed random variable.

n/a

Software refactoring is a well-known technique that provides transformations on software artifacts with the aim of improving their overall quality. In this paper we present a set of refactorings for ClassSheets, a modeling language that allows to specify the business logic of a spreadsheet in an object-oriented fashion. The set of refactorings that we propose allows us to improve the quality of these spreadsheet models. Moreover, it is implemented in a setting that guarantees that all model refactorings are automatically carried to all the corresponding (spreadsheet) instances, thus providing an automatic evolution of the data so it is always synchronized with the model.

n/a

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.