Dynamic group formation in mobile computer supported collaborative learning environment

Forming suitable learning groups is one of the factors that determine the efficiency of collaborative learning activities. However, only a few studies were carried out to address this problem in the mobile learning environments. In this paper, we propose a new approach for an automatic, customized, and dynamic group formation in Mobile Computer Supported Collaborative Learning (MCSCL) contexts. The proposed solution is based on the combination of three types of grouping criteria: learner’s personal characteristics, learner’s behaviours, and context information. The instructors can freely select the type, the number, and the weight of grouping criteria, together with other settings such as the number, the size, and the type of learning groups (homogeneous or heterogeneous). Apart from a grouping mechanism, the proposed approach represents a flexible tool to control each learner, and to manage the learning processes from the beginning to the end of collaborative learning activities. In order to evaluate the quality of the implemented group formation algorithm, we compare its Average Intra-cluster Distance (AID) with the one of a random group formation method. The results show a higher effectiveness of the proposed algorithm in forming homogenous and heterogeneous groups compared to the random method.

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

Evidence for inter- and intra-species biofilm formation variability among a small group of coagulase-negative staphylococci

Coagulase-negative staphylococci (CoNS) are common bacterial colonisers of the human skin. They are often involved in nosocomial infections due to biofilm formation in indwelling medical devices. While biofilm formation has been extensively studied in Staphylococcus epidermidis, little is known regarding other CoNS species. Here, biofilms from six different CoNS species were characterised in terms of biofilm composition and architecture. Interestingly, the ability to form a thick biofilm was not associated with any particular species, and high variability on biofilm accumulation was found within the same species. Cell viability assays also revealed different proportions of live and dead cells within biofilms formed by different species, although this parameter was particularly similar at the intra-species level. On the other hand, biofilm disruption assays demonstrated important inter- and intra-species differences regarding extracellular matrix composition. Lastly, confocal laser scanning microscopy (CLSM) experiments confirmed this variability, highlighting important differences and common features of CoNS biofilms. We hypothesised that the biofilm formation heterogeneity observed was rather associated with biofilm matrix composition than with cells themselves. Additionally, our results indicate that polysaccharides, DNA and proteins are fundamental pieces in the process of CoNS biofilm formation.

The group inverse of a product

In this paper, we characterize the existence and give an expression of the group inverse of a product of two regular elements by means of a ring unit.

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.

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.

Internship report of blog translation at the company Menina Design Group

Dissertação de mestrado em Tradução e Comunicação Multilingue