Parallelization of kinetic Monte Carlo algorithm to simulate AL3Sc precipitation

The present paper reports the precipitation process of Al3Sc structures in an aluminum scandium alloy, which has been simulated with a synchronous parallel kinetic Monte Carlo (spkMC) algorithm. The spkMC implementation is based on the vacancy diffusion mechanism. To filter the raw data generated by the spkMC simulations, the density-based clustering with noise (DBSCAN) method has been employed. spkMC and DBSCAN algorithms were implemented in the C language and using MPI library. The simulations were conducted in the SeARCH cluster located at the University of Minho. The Al3Sc precipitation was successfully simulated at the atomistic scale with the spkMC. DBSCAN proved to be a valuable aid to identify the precipitates by performing a cluster analysis of the simulation results. The achieved simulations results are in good agreement with those reported in the literature under sequential kinetic Monte Carlo simulations (kMC). The parallel implementation of kMC has provided a 4x speedup over the sequential version.

Comparison of single and multi-objective evolutionary algorithms for robust link-state routing

Traffic Engineering (TE) approaches are increasingly impor- tant in network management to allow an optimized configuration and resource allocation. In link-state routing, the task of setting appropriate weights to the links is both an important and a challenging optimization task. A number of different approaches has been put forward towards this aim, including the successful use of Evolutionary Algorithms (EAs). In this context, this work addresses the evaluation of three distinct EAs, a single and two multi-objective EAs, in two tasks related to weight setting optimization towards optimal intra-domain routing, knowing the network topology and aggregated traffic demands and seeking to mini- mize network congestion. In both tasks, the optimization considers sce- narios where there is a dynamic alteration in the state of the system, in the first considering changes in the traffic demand matrices and in the latter considering the possibility of link failures. The methods will, thus, need to simultaneously optimize for both conditions, the normal and the altered one, following a preventive TE approach towards robust configurations. Since this can be formulated as a bi-objective function, the use of multi-objective EAs, such as SPEA2 and NSGA-II, came nat- urally, being those compared to a single-objective EA. The results show a remarkable behavior of NSGA-II in all proposed tasks scaling well for harder instances, and thus presenting itself as the most promising option for TE in these scenarios.

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.

Assessing student individual performance within PBL teams: findings from the implementation of a new mechanism

This paper reports on the experience of the implementation of a new mechanism to assess individual student contribution within project work, where students work in teams to solve a large-scale open-ended interdisciplinary project. The study takes place at the University of Minho, with first year engineering students, enrolled in the Industrial Management and Engineering (Integrated Masters) degree. The aim of this paper is to describe the main principles and procedures underlying the assessment mechanism created and also provide some feedback from its first implementation, based on the students, lecturers and tutors perceptions. For data collection, a survey was sent to all course lecturers and tutors involved in the assessment process. Students also contributed with suggestions, both on a workshop held at the end of the project and also by answering a survey on the overall satisfaction with PBL experience. Findings show a positive level of acceptance of the new mechanism by the students and also by the lecturers and tutors. The study identified the need to clarify the criteria used by the lecturers and the exact role of the tutor, as well as the need for further improvement of its features and procedures. Some recommendations are also issued regarding technical aspects related to some of the steps of the procedures, as well as the need for greater support on the adjustment and final setting of the individual grades.

A violência sexual e de género nos campos de população refugiada: análise e enquadramento legal

Dissertação de mestrado em Direitos Humanos

Empathy and heart rate variability: a need and a mechanism of emotion regulation

Dissertação de mestrado integrado em Psicologia

Parallel improved Schnorr-Euchner enumeration SE++ for the CVP and SVP

The Closest Vector Problem (CVP) and the Shortest Vector Problem (SVP) are prime problems in lattice-based cryptanalysis, since they underpin the security of many lattice-based cryptosystems. Despite the importance of these problems, there are only a few CVP-solvers publicly available, and their scalability was never studied. This paper presents a scalable implementation of an enumeration-based CVP-solver for multi-cores, which can be easily adapted to solve the SVP. In particular, it achieves super-linear speedups in some instances on up to 8 cores and almost linear speedups on 16 cores when solving the CVP on a 50-dimensional lattice. Our results show that enumeration-based CVP-solvers can be parallelized as effectively as enumeration-based solvers for the SVP, based on a comparison with a state of the art SVP-solver. In addition, we show that we can optimize the SVP variant of our solver in such a way that it becomes 35%-60% faster than the fastest enumeration-based SVP-solver to date.

Mechanism of extracellular silver nanoparticles synthesis by Stereum hirsutum and Fusarium oxysporum

The increasing interest for greener and biological methods of synthesis has led to the development of non-toxic and comparatively more bioactive nanoparticles. Unlike physical and chemical methods of nanoparticle synthesis, microbial synthesis in general and mycosynthesis in particular is cost-effective and environment-friendly. However, different aspects, such as the rate of synthesis, monodispersity and downstream processing, need to be improved. Many fungal-based mechanisms have been proposed for the formation of silver nanoparticles (AgNPs), mainly those involving the presence of nitrate reductase, which has been detected in filtered fungus cell used for AgNPs production. There is a general acceptance that nitrate reductase is the main responsible for the reduction of Ag ions for the formation of AgNPs. However, this generally accepted mechanism for fungal AgNPs production is not totally understood. In order to elucidate the molecules participating in the mechanistic formation of metal nanoparticles, the current study is focused on the enzymes and other organic compounds involved in the biosynthesis of AgNPs. The use of each free fungal mycelium of both Stereum hirsutum and Fusarium oxysporum will be assessed. In order to identify defective mutants on the nitrate reductase structural gene niaD, fungal cultures of S.hirsutum and F.oxysporum will be selected by chlorate resistance. In addition, in order to verify if each compound identified as key-molecule influenced on the production of nanoparticles, an in vitro assay using different nitrogen sources will be developed. Lately, fungal extracellular enzymes will be measured and an in vitro assay will be done. Finally, The nanoparticle formation and its characterization will be evaluated by UV-visible spectroscopy, electron microscopy (TEM), X-ray diffraction analysis (XRD), Fourier transforms infrared spectroscopy (FTIR), and LC-MS/MS.

Concurrency detection on finish-to-start activity precedence networks

We explore the finish-to-start precedence relations of project activities used in scheduling problems. From these relations, we devise a method to identify groups of activities that could execute concurrently, i.e. activities in the same group can all execute in parallel. The method derives a new set of relations to describe the concurrency. Then, it is represented by an undirected graph and the maximal cliques problem identifies the groups. We provide a running example with a project from our previous studies in resource constrained project cost minimization together with an example application on the concurrency detection method: the evaluation of the resource stress.

A cadeia produtiva de alimentos orgânicos no vale do rio Cuiabá

Dissertação de mestrado em Estudos de Gestão

MMP-9/RECK imbalance: a mechanism associated with high-grade cervical lesions and genital infection by Human Papillomavirus (HPV) and Chlamydia trachomatis

"Manuscript"

Looking for mechanisms regulating lung growth in CDH: rat and human studies

Tese de Doutoramento em Ciências da Saúde

Concise server-wide causality management for eventually consistent data stores

Large scale distributed data stores rely on optimistic replication to scale and remain highly available in the face of net work partitions. Managing data without coordination results in eventually consistent data stores that allow for concurrent data updates. These systems often use anti-entropy mechanisms (like Merkle Trees) to detect and repair divergent data versions across nodes. However, in practice hash-based data structures are too expensive for large amounts of data and create too many false conflicts. Another aspect of eventual consistency is detecting write conflicts. Logical clocks are often used to track data causality, necessary to detect causally concurrent writes on the same key. However, there is a nonnegligible metadata overhead per key, which also keeps growing with time, proportional with the node churn rate. Another challenge is deleting keys while respecting causality: while the values can be deleted, perkey metadata cannot be permanently removed without coordination. Weintroduceanewcausalitymanagementframeworkforeventuallyconsistentdatastores,thatleveragesnodelogicalclocks(BitmappedVersion Vectors) and a new key logical clock (Dotted Causal Container) to provides advantages on multiple fronts: 1) a new efficient and lightweight anti-entropy mechanism; 2) greatly reduced per-key causality metadata size; 3) accurate key deletes without permanent metadata.

Monitoring for a decidable fragment of MTL-∫

Temporal logics targeting real-time systems are traditionally undecidable. Based on a restricted fragment of MTL-R, we propose a new approach for the runtime verification of hard real-time systems. The novelty of our technique is that it is based on incremental evaluation, allowing us to e↵ectively treat duration properties (which play a crucial role in real-time systems). We describe the two levels of operation of our approach: offline simplification by quantifier removal techniques; and online evaluation of a three-valued interpretation for formulas of our fragment. Our experiments show the applicability of this mechanism as well as the validity of the provided complexity results.

Reduction of QTc interval dispersion. Potential mechanism of cardiac protection of pyridostigmine bromide

OBJECTIVE: Parasympathetic dysfunction is an independent risk factor in individuals with coronary artery disease, and cholinergic stimulation is a potential therapeutical option. We determined the effects of pyridostigmine bromide, a reversible anticholinesterase agent, on electrocardiographic variables of healthy individuals. METHODS: We carried out a cross-sectional, double blind, randomized, placebo-controlled study. We obtained electrocardiographic tracings in 12 simultaneous leads of 10 healthy young individuals at rest before and after oral administration of 45 mg of pyridostigmine or placebo. RESULTS: Pyridostigmine increased RR intervals (before: 886±27 ms vs after: 1054±37 ms) and decreased QTc dispersion (before: 72±9ms vs after: 45±3ms), without changing other electrocardiographic variables (PR segment, QT interval, QTc, and QT dispersion). CONCLUSION: Bradycardia and the reduction in QTc dispersion induced by pyridostigmine may effectively represent a protective mechanism if these results can be reproduced in individuals with cardiovascular diseases.