Using relational algebra on the specification of real world ETL processes

Modeling Extract-Transform-Load (ETL) processes of a Data Warehousing System has always been a challenge. The heterogeneity of the sources, the quality of the data obtained and the conciliation process are some of the issues that must be addressed in the design phase of this critical component. Commercial ETL tools often provide proprietary diagrammatic components and modeling languages that are not standard, thus not providing the ideal separation between a modeling platform and an execution platform. This separation in conjunction with the use of standard notations and languages is critical in a system that tends to evolve through time and which cannot be undermined by a normally expensive tool that becomes an unsatisfactory component. In this paper we demonstrate the application of Relational Algebra as a modeling language of an ETL system as an effort to standardize operations and provide a basis for uncommon ETL execution platforms.

A relational algebra approach to ETL modeling

The MAP-i Doctoral Programme in Informatics, of the Universities of Minho, Aveiro and Porto

Recurrence relations for Clifford algebra-valued orthogonal polynomials

The theory of orthogonal polynomials of one real or complex variable is well established as well as its generalization for the multidimensional case. Hypercomplex function theory (or Clifford analysis) provides an alternative approach to deal with higher dimensions. In this context, we study systems of orthogonal polynomials of a hypercomplex variable with values in a Clifford algebra and prove some of their properties.

A linear algebra approach to OLAP

Inspired by the relational algebra of data processing, this paper addresses the foundations of data analytical processing from a linear algebra perspective. The paper investigates, in particular, how aggregation operations such as cross tabulations and data cubes essential to quantitative analysis of data can be expressed solely in terms of matrix multiplication, transposition and the Khatri–Rao variant of the Kronecker product. The approach offers a basis for deriving an algebraic theory of data consolidation, handling the quantitative as well as qualitative sides of data science in a natural, elegant and typed way. It also shows potential for parallel analytical processing, as the parallelization theory of such matrix operations is well acknowledged.

Human mobility patterns at the smallest scales

We present a study on human mobility at small spatial scales. Differently from large scale mobility, recently studied through dollar-bill tracking and mobile phone data sets within one big country or continent, we report Brownian features of human mobility at smaller scales. In particular, the scaling exponents found at the smallest scales is typically close to one-half, differently from the larger values for the exponent characterizing mobility at larger scales. We carefully analyze 12-month data of the Eduroam database within the Portuguese university of Minho. A full procedure is introduced with the aim of properly characterizing the human mobility within the network of access points composing the wireless system of the university. In particular, measures of flux are introduced for estimating a distance between access points. This distance is typically non-Euclidean, since the spatial constraints at such small scales distort the continuum space on which human mobility occurs. Since two different ex- ponents are found depending on the scale human motion takes place, we raise the question at which scale the transition from Brownian to non-Brownian motion takes place. In this context, we discuss how the numerical approach can be extended to larger scales, using the full Eduroam in Europe and in Asia, for uncovering the transi- tion between both dynamical regimes.

Annular flow of viscoelastic fluids: Analytical and numerical solutions

This work provides analytical and numerical solutions for the linear, quadratic and exponential Phan–Thien–Tanner (PTT) viscoelastic models, for axial and helical annular fully-developed flows under no slip and slip boundary conditions, the latter given by the linear and nonlinear Navier slip laws. The rheology of the three PTT model functions is discussed together with the influence of the slip velocity upon the flow velocity and stress fields. For the linear PTT model, full analytical solutions for the inverse problem (unknown velocity) are devised for the linear Navier slip law and two different slip exponents. For the linear PTT model with other values of the slip exponent and for the quadratic PTT model, the polynomial equation for the radial location (β) of the null shear stress must be solved numerically. For both models, the solution of the direct problem is given by an iterative procedure involving three nonlinear equations, one for β, other for the pressure gradient and another for the torque per unit length. For the exponential PTT model we devise a numerical procedure that can easily compute the numerical solution of the pure axial flow problem

Da modelação matemática à simulação computacional: a experimentação matemática no ensino

Tese de Doutoramento em Ciências (área de especialização em Matemática).

Da modelação matemática à simulação computacional: a experimentação matemática no ensino

Tese de Doutoramento em Ciências (área de especialização em Matemática).

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.

Singularities of the dynamical structure factors of the spin-1/2 XXX chain at finite magnetic field

We study the longitudinal and transverse spin dynamical structure factors of the spin-1/2 XXX chain at finite magnetic field h, focusing in particular on the singularities at excitation energies in the vicinity of the lower thresholds. While the static properties of the model can be studied within a Fermi-liquid like description in terms of pseudoparticles, our derivation of the dynamical properties relies on the introduction of a form of the ‘pseudofermion dynamical theory’ (PDT) of the 1D Hubbard model suitably modified for the spin-only XXX chain and other models with two pseudoparticle Fermi points. Specifically, we derive the exact momentum and spin-density dependences of the exponents ζτ(k) controlling the singularities for both the longitudinal  and transverse (τ = t) dynamical structure factors for the whole momentum range  , in the thermodynamic limit. This requires the numerical solution of the integral equations that define the phase shifts in these exponents expressions. We discuss the relation to neutron scattering and suggest new experiments on spin-chain compounds using a carefully oriented crystal to test our predictions.

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.

Metaphorisms in programming

This paper introduces the metaphorism pattern of relational specification and addresses how specification following this pattern can be refined into recursive programs. Metaphorisms express input-output relationships which preserve relevant information while at the same time some intended optimization takes place. Text processing, sorting, representation changers, etc., are examples of metaphorisms. The kind of metaphorism refinement proposed in this paper is a strategy known as change of virtual data structure. It gives sufficient conditions for such implementations to be calculated using relation algebra and illustrates the strategy with the derivation of quicksort as example.

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.

Blow-up and finite time extinction for p(x, t)-curl systems arising in electromagnetism

"Available online 22 March 2016"